Depth-First Binary Tree Traversal
Given a binary tree, three operations must be performed at each node during traversal:
- V: Visit the node (apply some specified operation, such as print)
- L: Traverse the left subtree
- R: Traverse the right subtree
Out of six possible orders, three are generally useful (we only use the ones where we traverse the left subtree before the right):
- VLR: preorder (Visit precedes Left and Right)
- LVR: inorder (Visit between Left and Right)
- LRV: postorder or endorder (Visit after Left and Right)
- Preorder: L, E, B, H, N, R, P
- Inorder: B, E, H, L, N, P, R
- Postorder: B, H, E, P, R, N, L