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.
A node is called a leaf if it has no direct descendants, i.e.,
if it never appears as a value in the parent array (ignoring the value 0).
Write a program that reads n and the values of the parent array, and
prints the number of leaves in the tree.
The first line contains the natural number `n`. The second line contains the `n` values of the parent array, separated by spaces. - `1 <= n <= 100` - `0 <= t[i] <= n` for every `i` in `1..n` - the array describes a valid tree - if the tree has a single node, that node is considered a leaf
The program prints a single natural number: the number of leaves.
7 2 4 4 0 4 5 5
4
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 4 4 0 4 5 5
4
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.
