Unique Binary Search Trees（不同二叉排序树个数）

Given n, how many structurally unique BST's (binary search trees) that store values 1...n?

For example,
Given n = 3, there are a total of 5 unique BST's.

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

卡特兰数 网上资料太多了 这里用递归公式避免数据溢出

class Solution {
public:
    int numTrees(int n) {
		// Note: The Solution object is instantiated only once and is reused by each test case.
		//h(n ) = h(n-1)*(4*n-2) / (n+1)
		if (n == 0)
			return 0;
		if (n == 1)
			return 1;
		return numTrees(n - 1) * (4 * n - 2) / (n + 1);
	}
};