85 votes
18 answers
83
85 votes
9 answers
84
83 votes
4 answers
93
83 votes
13 answers
94
81 votes
4 answers
97
81 votes
6 answers
100
Let $T(n)$ be the number of different binary search trees on $n$ distinct elements.Then $T(n) = \sum_{k=1}^{n} T(k-1)T(x)$, where $x$ is $n-k+1$$n-k$$n-k-1$$n-k-2$