DSA-Using-C

4. Traversing a Binary Tree

• 1. Pre-order Traversal
• 2. In-order Traversal
• 3. Post-order Traversal
• 4. Level-order Traversal
• 5. Constructing a Binary Tree from Traversal Results