Why binary tree node n0 and more than 1 node n2
Because all bit binary number of nodes is not greater than 2, the total number of (1) the node n = n0 + n1 + n2
and because of the degree of the node 1 and 2 are respectively 1 and 2 subtree subtrees, so neutron binary tree node there
(2) n (sub) = n1 + 2n2
in the root node of the binary tree is not only the sub-tree nodes, so the total number of binary node
n (total) = n (a), i.e., +1 n (total ) = n1 + 2n2 + 1
binding (1) and (2) have the formula
n0 = n2 + 1
