Highest voted questions in Programming and DS

168 votes
17 answers
2
90 votes
11 answers
14
81 votes
6 answers
20
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$