1.

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

A. L = 2I
B. L = I + 1
C. L = I – 1
D. L = 2I – 1
Answer» C. L = I ‚Äö√Ñ√∂‚àö√ë‚àö¬® 1


Discussion

No Comment Found