Skip to content
Related Articles

Related Articles

ISRO | ISRO CS 2017 | Question 54
  • Last Updated : 11 Sep, 2019

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

My Personal Notes arrow_drop_up
Recommended Articles
Page :