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.
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.
The name is Catalan Equation (Sequence).
I think this thread contains the information you want.