The minimum height of an AVL tree with n nodes is
2020
The minimum height of an AVL tree with n nodes is
- A.
Ceil (log2 (n + 1))
- B.
1.44 log2 n
- C.
Floor (log2 (n + 1))
- D.
1.64 log2 n
Attempted by 608 students.
Show answer & explanation
Correct answer: C
If there are n nodes in AVL tree, minimum height is Floor (log2 (n + 1)).
A video solution is available for this question — log in and enroll to watch it.