Depth First Search/Traversal in Binary Tree

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

Appraoch:

• Approach is quite simple, use Stack.
• First add the add root to the Stack.
• Pop out an element from Stack and add its right and left children to stack.
• Pop out an element and print it and add its children.
• Repeat the above two steps until the Stack id empty.

Example:

Run This Code

Code:

Output:

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

Also Read:

- Count number of pairs in an array with sum = K Medium
- Sorted Array to Binary Search Tree of Minimal Height Medium
- Get the Sum of all left leaves in a Binary tree Beginner
- In an Array, find the Smallest Subarray with Sum Greater than the Given Value Medium
- Print the Bottom View of the Binary Tree. Medium
- Find a pair of numbers from an array whose sum equals k Beginner
- Backtracking - Knight's Tour Problem Hard
- Given a binary tree, Print All the Nodes that don't have Siblings. Beginner