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
public class Solution {
public int numTrees(int n) {
if (n == 0) {
return 0;
}
int[] f = new int[n + 1];
f[0] = 1;
for (int i = 1; i <= n; i++) {
for (int root = 1; root <= i; root++) {
f[i] += f[root - 1] * f[i - root];
}
}
return f[n];
}
}