80. Find Nodes at Distance X from Root in a Tree

Objective: - Given Binary Tree, Print all the nodes which are X distance from the root

Example :

Approach:

• Do the preorder traversal, and pass x as a parameter.
• While going down, at each level, keep reducing the x by 1
• When x = 0, this means you have reached the nodes that are at x distance from the root, Print them.

Output:

Output:
Nodes at 3 distance from root :
 6 7 9

Related Problems:

- Merge Sort - Updated - Most Efficient ways to Implement Medium
- Inorder Predecessor and Successor in Binary Search Tree Hard
- Find the Deepest Node in a Binary Tree Medium
- Populate Next Right Pointers in Each Node Hard
- In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium