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

GATE · 2003 · CS

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

GATECS2003Q7

, where x is

A.
n-k+1
B.
n-k
C.
n-k-1
D.
n-k-2

Attempted by 344 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

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