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:
The worst-case height of an AVL tree is 1.44 log n, where n is the number of nodes in the tree. This height is achieved when the tree is perfectly balanced. The value 1.44 is an approximation of the constant factor for the height of AVL trees. It’s often rounded up to 2 in some discussions, but 1.44 is a more accurate constant.
Hence, Correct Option is option B
Quiz of this Question
Please comment below if you find anything wrong in the above post