Nodes at Distance K

Asked in:
Amazon

Problem Description

Given the root of a binary tree A, the value of a target node B, and an integer C, return an array of the values of all nodes that have a distance C from the target node.

You can return the answer in any order.

Problem Constraints

1 ≤ N ≤ 10⁵ (N is the number of nodes in the binary tree)
1 ≤ A_i ≤ N (A_i denotes the values of the nodes in the tree)
All the values in the nodes are unique.
1 ≤ C ≤ 10⁴

Input Format

The first argument is the root node of the binary tree A.
The second argument is an integer B denoting the label of the target node.
The third argument is an integer C denoting the distance.

Output Format

Return an array of integers denoting the nodes which are at a distance C from the node B.

Example Input

Input 1:

Input 2:

Example Output

Output 1:

[1, 4, 5]

Output 2:

[3]

Example Explanation

Explanation 1:

For the given tree, we have target node as 2.
All the nodes with are at distance 1, meaning the adjacent nodes are [1, 4, 5].

Explanation 2:

The given tree is same, and [3] is the only node with distance 2.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Nodes at Distance K on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Amazon

Nodes at Distance K

Discussion