+1 vote
in Data Structures & Algorithms I by (110k points)
In a full binary tree if number of internal nodes is I, then number of leaves L are?

(a) L = 2*I

(b) L = I + 1

(c) L = I – 1

(d) L = 2*I – 1

My query is from Binary Tree Properties in division Binary Trees of Data Structures & Algorithms I

The question was asked in examination.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right choice is (b) L = I + 1

The best explanation: Number of Leaf nodes in full binary tree is equal to 1 + Number of Internal Nodes i.e L = I + 1

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.