Binary Tree Traversal
Inorder / Preorder / Postorder / Level-order (BFS). LC 94, 144, 145, 102.
Unvisited
Current
Visited (order)
In queue (BFS)
Controls
Time: O(n) | Space: O(h) DFS / O(n) BFS
Visit order
0 stepsPress Run to trace the algorithm one step at a time.