A strictly binary tree with 10 leaves
(A)
cannot have more than 19 nodes
(B)
has exactly 19 nodes
(C)
has exactly 17 nodes
(D)
has exactly 20 nodes
Answer: (B)
Explanation:
A strict binary tree with ‘n’ leaf nodes always have ‘2n-1’ intermediate nodes. With 10 leaf nodes a strict binary tree will have exactly 19 nodes. So, option (B) is correct.
Quiz of this Question
Please comment below if you find anything wrong in the above post
Article Tags :
Recommended Articles