Sets the degree of a tree to 3, which is suitable for 3 0 degrees of node number 3,4,15, respectively, are summed up in the tree points for (),

Analytic:

In tree structure, after a node has a number of known as the node degree, the largest of all nodes degrees is called a tree, the tree of the nodes is the degree of all nodes in the tree and the sum of 1, assuming moderate to bear on the junction of 2 points for n, summarizes the points of m, m=3 * 3 + n + 1 * 4 * 2 + 1, leaf nodes=15 m - (3 + 4 + n), n=8, is m=9 + 4 + 8 x 2 + 1=30,

CodePudding user response:

Each node has several child nodes (c) all add up to add up all the node degrees, then add a root node is the total number of nodes of the tree,
This is easy to understand, a pile of words looked at brain kuo pain when their draft paper tree count, first from the simple painting, such as a root node, a situation that is a child node under the root node, and so on and so on,