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.