Tree Traversals (Pre / In / Post)
EasyOne depth first walk, three visit times. Pre-order records on the way in, in-order between the children, post-order on the way out.
recursionDFS
TimeO(n)
SpaceO(h) for the call stack
InputLevel order values
5
3
8
1
4
7
9
The same traversal produces three different orders depending on when you record the node.
1 / 23
dfs(node):
if node is null: return
visit(node) // pre-order
dfs(node.left)
visit(node) // in-order
dfs(node.right)
visit(node) // post-order
Why it matters
In-order on a BST emits sorted values. Post-order is what you need when a node depends on its children.
Keyboard
space play← → stepr restartctrl K search
More in Trees
Next visualiser
Level Order Traversal