The minimum height of an AVL tree with n nodes is

2020

The minimum height of an AVL tree with n nodes is

Answer: C. Floor (log2 (n + 1)) — If there are n nodes in AVL tree, minimum height is Floor (log2 (n + 1)).

  1. A.

    Ceil (log2 (n + 1))

  2. B.

    1.44 log2 n

  3. C.

    Floor (log2 (n + 1))

  4. D.

    1.64 log2 n

Attempted by 1063 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.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…