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 http://lcm.csa.iisc.ernet.in/dsa/node112.html
Quiz of this Question
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.