AlgoViz
← Back to the lesson
🧩 Puzzle · Apply Tree Traversal

Walk in order

In-order traversal has one rule, applied at every node: visit the whole LEFT subtree, then the node itself, then the whole RIGHT subtree. Click the nodes of this binary search tree in that order. Watch what comes out — there's a reason in-order is the traversal people reach for on a BST.

Binary search tree · click the values in in-order sequence
50307020406080
In-order = left subtree, then the node, then right subtree. Click the first node.
Amber = the next node in-order. Green = already emitted (with its order #).output: