Data Structures | Balanced Binary Search Trees | Question 10

What is the worst case possible height of AVL tree?
(A) 2Logn
Assume base of log is 2

(B) 1.44log n
Assume base of log is 2

(C) Depends upon implementation
(D) Theta(n)

Answer: (B)

Explanation: See

Quiz of this Question

My Personal Notes arrow_drop_up

Practice Tags :

Recommended Posts:

0 Average Difficulty : 0/5.0
No votes yet.

User Actions