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:

- Find the Deepest Node in a Binary Tree. Medium
- Print The Top View of a Binary Tree Medium
- Lowest Common Ancestor in a Binary Search Tree. Medium
- Find the n'th Node from the end of a given Linked List Beginner
- Dynamic Programming - Longest Common Subsequence Medium
- Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Medium
- Find Whether Given String is palindrome or Not. Beginner
- Given an array, print all unique subsets with a given sum. Medium