Vidyalelo
Data Structure · Q180

Binary Search Trees(B Tree)

Programming · Data Structure · question 180

Q180

What maximum difference in heights between the leafs of a AVL tree is possible?

A.
log(n) where n is the number of nodes
Answer
B.
n where n is the number of nodes
C.
0 or 1
D.
atmost 1

Answer: Option A

Solution

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