Trees· 10 min

In-order Traversal

Left → Root → Right — produces sorted output

Setup

Step 1 / 30

Current step

1 / 30

Start at the root — call inorder(50)

Step log

7 nodes · depth 3 · drag to pan, scroll to zoom
Current / on path
Visited
Just inserted
Found
inorder_traversal.java
1void inorder(Node node) {
2    if (node == null) return;
3    inorder(node.left);
4    visit(node);
5    inorder(node.right);
6}
● Java
Call stack1 frame
inorder(50)active
Traversal output0 / 7

nothing visited yet

In-order Traversal

In-order traversal visits every node in a specific order. In-order on a BST produces values in sorted ascending order.

Nodes
7
Mode
traversal
Time (avg)
O(log n)
Time (worst)
O(n)
50307020406080
20 / 46