When height is counted as the number of levels, with the root at level 1, the…
ISRO Scientist/Engineer SC · 2020 · Computer Science
When height is counted as the number of levels, with the root at level 1, 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 1317 students.
Sign up free to check your answer
Sign up freeLoading lesson…