A tree with n nodes numbered from 1 to n is represented by
the parent array t, where t[i] is the parent of node i, and
t[i] = 0 means that node i is the root of the tree.
The root is at depth 0, children of the root are at depth 1, and
in general a node is at depth equal to the number of edges on the path
from it to the root.
An additional natural number d is read. Print, in ascending order of
index, all nodes that are at depth d. If no such node exists, print 0.
The first line contains two natural numbers `n` and `d`, separated by a space. The second line contains the `n` values of the parent array, separated by spaces. - `1 <= n <= 100` - `0 <= d <= n` - the array describes a valid tree
The program prints the indices of the nodes at depth `d`, in ascending order, separated by spaces, or `0` if no such node exists.
7 2 2 4 4 0 4 5 5
1 6 7
Use the Get Hint button in the action bar to reveal a guided hint.
No comments yet. Be the first to start the discussion!
7 2 2 4 4 0 4 5 5
1 6 7
Community solutions unlock after you submit a passing solution. Don't peek.
Create a free account to write code, submit solutions, and track your progress.
