Expert: Sherman D. - 3/9/2005

Question
Hello,
Sorry for taking your time.
Would you please tell me a solution for the quantity of binary search trees with " n " keys.
I know that the answer is :
[ 1 / ( n+1 ) ] * [ 2n! / (n! * n!) ]
but I do not know how is the solution because the equation is unlinear.
So pleade help me or introduce me a source through the internetwitch have the solution completly.
Take care of yourself.

Answer
(1/(n + 1)) * ((2n!)/((n! * n!)))

(1/(n + 1)) * ((2n!)/((n!)^2)))

(1/(n + 1)) * (2/(n!))

2/(n!(n + 1))

Here is what i have fount
http://linneus1.ethz.ch:8080/4_7_1.html
www.cs.gordon.edu/courses/cs321/lectures/Btrees.html

Sorry i couldn't be of more help.