Definition
Compare three classic traversals of a binary tree: preorder, inorder, and postorder.
Key Characteristics
- ✓Preorder: visit root first
- ✓Inorder: left → root → right (sorted for BST)
- ✓Postorder: children first, then root
Use Cases
Used in these scenarios:
📈
BST sorted output
Inorder yields ascending order
🪓
Copy/Delete subtrees
Postorder processes children first
🧮
Expression tree eval
Use preorder/postorder to express operations
Complexity
Time Complexity
Best
O(N)
Average
O(N)
Worst
O(N)
Space Complexity
O(H)
Understand Deeper with Visualization
See how the algorithm works through step-by-step animations and code execution.
Start Visualization