Print node at d distance

Given a binary tree, a target node in the binary tree, and an integer value k, print all the nodes that are at distance k from the given target node. No parent pointers are available. Input: First line contains an integer n denoting the number of edges. Then the following line contains the edges as given in the example. The next line contains the target node. The last line of the input contains