A node with a degree of 0 in a binary tree is 1 more than a node with a degree of 2. n0=n2+1

The total number of nodes in the binary tree is N N
N=n0+n1+n2
N=n2 2+n1 1+n0*0+1 The
solution is: n0=n2+1

Guess you like

Origin blog.csdn.net/qq_46620129/article/details/113797918