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
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