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 int numTrees(int n) {
// Start typing your Java solution below
// DO NOT write main() function
if (n <= 0) {
return 0;
}
return dfs(1, n);
}
int dfs(int start, int end) {
if (end - start <= 0) {
return 1;
} else if (end - start == 1) {
return 2;
} else if (end - start == 2) {
return 5;
}
int sum = 0;
for (int i = start; i <= end; i++) {
sum += dfs(start, i - 1) * dfs(i + 1, end);
}
return sum;
}