DAYS
HOUR
MINS
SEC
Error
Given a binary tree, a target node in the binary tree, and an integer value k, find all the nodes that are at distance k from the given target node. No parent pointers are available.
Example 1:
Input: 20 / \ 8 22 / \ 4 12 / \ 10 14 Target Node = 8 K = 2 Output: 10 14 22 Explanation: The three nodes at distance 2 from node 8 are 10, 14, 22.![]()
Example 2:
Input: 20 / \ 7 24 / \ 4 3 / 1 Target Node = 7 K = 2 Output: 1 24
Your Task:
You don't need to read input or print anything. Complete the function KDistanceNodes() which takes the root of the tree, target, and K as input parameters and returns a list of nodes at k distance from target in a sorted order.
Expected Time Complexity: O(N*logN)
Expected Auxiliary Space: O(Height of tree)
Constraints:
1 ≤ N ≤ 103
1 ≤ data of node ≤ 104
1 ≤ target ≤ 104
1 ≤ k ≤ 20
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes