- Sum of children nodes

Algorithm Design and Analysis

Using Dev-C++

Requirements: Calculate the number of children of each point in the tree. Assume that the node is 0 as the root of the tree. Input: Line 1 , an integer n, represents the number of nodes in the tree. Lines n, each Line has two integers x and y, that there is an edge between the x and y. nodes, and node x is not necessarily y 's father. Output: n integers, the ith integer is the number of children of node i. Oneration effect