Number of binary search trees over n distinct elements

Question

How many binary search trees can be constructed from n distinct elements? And how can we find a mathematically proved formula for it?

Example:

Answer 1

I am sure this question is not just to count using a mathematical formula.. I took out some time and wrote the program and the explanation or idea behind the calculation for the same.

I tried solving it with recursion and dynamic programming both. Hope this helps.

The formula is already present in the previous answer:

So if you are interested in learning the solution and understanding the apporach you can always check my article Count Binary Search Trees created from N unique elements