C(n)= 2nCn * 1/(n+1)
The above sequence is used to find the possible no. of binary search trees, I want to know that what is the name of above sequence and the purposes for which this sequence can be used efficiently.
Asked
Active
Viewed 95 times
1 Answers
2
The name is Catalan Equation (Sequence).
I think this thread contains the information you want.
Community
- 1
- 1
Chathuranga Chandrasekara
- 19,894
- 28
- 96
- 137
-
But I want to know what are the various places where this catalan sequence is efficiently used, any e.g. would be gratefull – Syed Mehmood Ali Jan 15 '10 at 10:35