94. Depth First Search/Traversal in Binary Tree

Objective: - Given a Binary Search Tree, Do the Depth First Search/Traversal.

Approach:

1. The approach is quite simple, use Stack.
2. First, add the add root to the Stack.
3. Pop out an element from Stack, Print it and add its right and left children to Stack.
4. Repeat the above two steps until the Stack is empty.

Example:

Code:

Output:

Depth-First-Search :
 1 2 4 5 3 6 7

Related Problems:

- Given an array, print all unique subsets with a given sum. Medium
- Shortest Range in K-sorted Lists Hard
- Printing Nodes without Siblings in a Binary Tree Beginner
- Number of Islands Medium
- Lowest Common Ancestor in a Binary Search Tree. Medium