ISRO | ISRO CS 2009 | Question 30
A full binary tree with n leaves contains:
(A) n nodes
(B) log2 n nodes
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.
Option (C) is correct.
Quiz of this Question