Print All The Nodes Which are X distance from the Leaf Nodes

Objective: - Given Binary Tree, Print All The Nodes Which are X distance from the Leaf Nodes

Example :

Approach:

• This Problem is the extension of " Print paths from the root to all leaf nodes"
• Instead of printing all the nodes in the array, print nodes that are at (pathLength-x), which will be the nodes that are the x distance from the leaf nodes.
• To avoid printing the redundant values, because one node can be at the x distance from the multiple leaf nodes, use boolean visited[] ( similar to path[] ) and mark it true once the node is printed.

Run This Code

Code:

Output:

Nodes at distance by 2 :  2  3
Nodes at distance by 1 :  4  6

Also Read:

- Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths Medium
- In a Binary Tree, Check if two nodes are Cousins Medium
- Find The Distance From Root To Given Node of a Binary Tree. Medium
- Print All N Length Strings from Given Number K Hard
- Find a peak element in a Given Array Beginner
- Print All The Full Nodes in a Binary Tree Beginner
- Find the Deepest Left Node in a Binary Tree. Medium
- Check if Two BST's are Identical Beginner