This post is completed by 1 user Login To Mark Completed

0

Add to List Add To List..(Max 5) Close Save

Medium

Print All The Nodes Which are X distance from the Root

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

Example :

Appraoch:

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

Run This Code

Code:

Output:

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

---

---

Also Read:

- Lowest Common Ancestor in a Binary Search Tree. Medium
- Print the Binary Tree in Vertical Order Path. Medium
- Print the Bottom View of the Binary Tree. Medium
- Find the Deepest Left Node in a Binary Tree. Medium
- Given an array, find all unique subsets with a given sum with allowed repeated digits. Medium
- Find a peak element in a Given Array Beginner
- Make a Binary Tree from Given Inorder and Preorder Traveral. Hard
- Print the Vertical Sum in binary Tree . Medium

---