K distance from root GFG POTD Python Solution geeks for geeks problem of the day
Problem - https://www.geeksforgeeks.org/problem...
Given a binary tree having n nodes and an integer k. Print all nodes that are at distance k from the root (root is considered at distance 0 from itself). Nodes should be printed from left to right.
Example 1:
Input:
k = 0
1
/ \
3 2
Output:
1
Explanation:
1 is the only node which is 0 distance from the root 1.
Example 2:
Input:
k = 3
1
/
2
\
1
/ \
5 3
Output:
5 3
Explanation:
5 and 3 are the nodes which are at distance 3 from the root 3.
Here, returning 3 5 will be incorrect