cho.shresearchmini
ProblemCode
Description
Time limit
Memory limit
A leaf node is a node with no children.
You are given a tree. When one node is deleted, that node and all of its descendants disappear from the tree. Find the number of leaf nodes remaining after deleting the specified node.
The tree below has 3 leaf nodes. The nodes colored green are leaf nodes.
If node 1 is deleted from this tree, node 1 and its descendants are removed together. The nodes colored black are the deleted nodes.
In this case, the remaining tree has 1 leaf node.
The first line contains the number of nodes N. N is a positive integer no greater than 50.
The second line contains the parent of each node from node 0 through node N-1, in order. For the root node, which has no parent, the value is -1.
The third line contains the number of the node to delete.
Print the number of leaf nodes remaining after deleting the specified node.