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.
An additional natural number x with 1 <= x <= n is also read. Print,
in ascending order, the indices of the direct children of node x.
If node x has no direct children (it is a leaf), print the word
frunza (no diacritics).
The first line contains two natural numbers `n` and `x`, separated by a space. The second line contains the `n` values of the parent array, separated by spaces. - `1 <= n <= 100` - `1 <= x <= n` - the array describes a valid tree
The program prints the direct children of node `x` in ascending order, separated by spaces. If node `x` is a leaf, the program prints `frunza`.
7 4 2 4 4 0 4 5 5
2 3 5
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 4 2 4 4 0 4 5 5
2 3 5
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.
