ISRO | ISRO CS 2009 | Question 30

A full binary tree with n leaves contains:
(A) n nodes
(B) log2 n nodes
(C) 2n-1
(D) 2n


Answer: (C)

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



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.