Let \(T\) be a binary search tree with \(15\) nodes. The minimum and maximum…

GATE · 2017 · CS · Set 1 · Computer Science & IT

Let \(T\) be a binary search tree with \(15\) nodes. The minimum and maximum possible heights of \(T\) are:

Note: The height of a tree with a single node is \(0\).

  1. A.

    4 and 15 respectively.

  2. B.

    3 and 14 respectively.

  3. C.

    4 and 14 respectively.

  4. D.

    3 and 15 respectively.

Attempted by 584 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

Video solution available to enrolled students.

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

Loading lesson…