Explain 'Recursive' tree traversal.

Explain 'Recursive' tree traversal.

Approach: Describe using the function stack to visit children.

The function calls itself for the left child, performs the visit logic, and calls itself for the right child. The base case is reaching a null node.

Follow-up: Can you do this without recursion?

Key concepts: base case, left/right, call stack.