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.Problem Constraints
You can return the answer in any order.
1 ≤ N ≤ 105 (N is the number of nodes in the binary tree)Input Format
1 ≤ Ai ≤ N (Ai denotes the values of the nodes in the tree)
All the values in the nodes are unique.
1 ≤ C ≤ 104
The first argument is the root node of the binary tree A.Output Format
The second argument is an integer B denoting the label of the target node.
The third argument is an integer C denoting the distance.
Return an array of integers denoting the nodes which are at a distance C from the node B.Example Input
A = 1
B = 2
C = 1
A = 1
B = 2
C = 2
[1, 4, 5]
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].
The given tree is same, and  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.