A Binary Tree is full if every node has 0 or 2 children. So, in such case, the binary tree with n leaves contains a total of 2*n-1 nodes.
There are 4 leaf nodes in the above tree.
So, total number of nodes are 2*4-1
=8-1
=7

Correct Answer: C

Question 25 Explanation:

A Binary Tree is full if every node has 0 or 2 children. So, in such case, the binary tree with n leaves contains a total of 2*n-1 nodes.
There are 4 leaf nodes in the above tree.
So, total number of nodes are 2*4-1
=8-1
=7