Let T(n) be the number of different binary search trees on n distinct…

PYQ GATE 2003

Let T(n) be the number of different binary search trees on n distinct elements.
Then

GATECS2003Q7

, where x is

  1. A.

    n-k+1

  2. B.

    n-k

  3. C.

    n-k-1

  4. D.

    n-k-2

Attempted by 454 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…