In-Order Traversal Visualizer

Visualize how in-order traversal visits nodes in a binary search tree

Speed:1x
Nodes
0
Steps
0
Tree is empty

Tree Visualization

No tree generated yet

About In-Order Traversal

Visits nodes in the order:

  1. Left subtree
  2. Root node
  3. Right subtree

For BSTs, this produces nodes in sorted order.

Algorithm:

function inOrder(node) {
  if (node !== null) {
    inOrder(node.left);
    visit(node);
    inOrder(node.right);
  }
}
Time
O(n)
Space
O(h)