Aim : Implementation of recursive and iterative traversals on binary tree.

Theory

A **binary tree** is a hierarchical data structure where each node has at most two children: left and right.

🔹 Types of Tree Traversals:

• Inorder Traversal (Left, Root, Right)
• Preorder Traversal (Root, Left, Right)
• Postorder Traversal (Left, Right, Root)

🔹 Recursive vs Iterative Traversal

• Recursive uses function calls (simpler but uses extra space for recursion).
• Iterative uses stacks/queues to avoid recursion (efficient for large trees).

📌 Algorithm

1. Recursive Traversal

• Base Case: If node is NULL, return.
• Follow order for Inorder, Preorder, or Postorder traversal.

2. Iterative Traversal

• Use a **stack** for Preorder and Inorder traversals.
• Use a **queue** for Level Order traversal.