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
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 zambiatek!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 zambiatek!
