1.

A binary tree with n > 1 nodes has n1,n2 and n3 nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours.n3 can be expressed as:

Answer»

A binary tree with n > 1 nodes has n1,n2 and n3 nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours.



n3 can be expressed as:



Discussion

No Comment Found