In a full binary tree if number of internal nodes is I, then number of leaves L are?

Category: QuestionsIn a full binary tree if number of internal nodes is I, then number of leaves L are?
Editor">Editor Staff asked 4 weeks ago

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 Answers
Editor">Editor Staff answered 4 weeks ago

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