Tree Traversal

Traversing a data structure: to process every node exactly once.

To traverse a binary tree, do the following steps in some order:

• (L) traverse the left subtree.
• (R) traverse the right subtree.
• (N) process the node itself.

Pre-Order Traversal: do (N) first.

Post-Order Traversal: do (N) last.

In-Order Traversal: do (N) second.