Vidyalelo
Data Structure · Q59

Binary Search Trees(B Tree)

Programming · Data Structure · question 59

Q59

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
Answer
C.
L = I - 1
D.
L = 2*I - 1

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board