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

PYQ GATE 2017

Let TT be a binary search tree with 1515 nodes. The minimum and maximum possible heights of TT are:

Note: The height of a tree with a single node is 00.

  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 708 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…