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
, where x is
- A.
n-k+1
- B.
n-k
- C.
n-k-1
- D.
n-k-2
Attempted by 371 students.
Sign up free to check your answer
Sign up freeLoading lesson…