give a full binary tree with n internal nodes how many leaf node does it have
Answers
Answered by
0
Answer:
In the simplest case a binary tree with a root node, a left and a right has 3 nodes, two of which are leaf nodes. It's (n+1)/2. If your total number nodes are n , and i are the total number of internal nodes ,i.e., whose degrees are 1.
Similar questions