Summary

• Pre-Order Traversal: Root → Left → Right
• 
  
• In-Order Traversal: Left → Root → Right
• 
  
• Post-Order Traversal: Left → Right → Root

These traversal methods can be implemented recursively or iteratively using a stack. They are fundamental techniques used in various tree-based algorithms and applications.

Traversal of a binary tree involves visiting all the nodes in a specific order. The three primary depth-first traversal methods are pre-order, in-order, and post-order. Here’s how each of these traversals works:

Pre-Order Traversal

Pre-Order Traversal involves visiting nodes in the following order:

1. Root
2. Left Subtree
3. Right Subtree