UGC-NET | UGC NET CS 2018 July – II | Question 26

A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves :
(A) cannot have more than 37 nodes
(B) has exactly 37 nodes
(C) has exactly 35 nodes
(D) cannot have more than 35 nodes

Answer: (B)

Explanation: 2(n)-1 where n is the for the leaves nodes. So by that way we have exactly 37 nodes.

Option (B) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up

Improved By : pabla007

Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.