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:

Quiz of this Question
Please comment below if you find anything wrong in the above post



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.