求结点数位n的 二叉排序树个数

利用动态规划的思想

设S(n)为情况数

S(0) = S(1) = 1

S(2) = 2

S(3) = S(0)*S(2)  + S(1)*S(1) + S(2)*S(0)

S(4) = S(0)*S(3) + S(1)*S(2) + S(2)*S(1) + S(3)*S(0)

其实就是S(n) = S(0)*S(n-1) + S(1) * S(n-2) + ... + S(n-1)*S(0)

PS：来自leedcode unique-binary-search-trees