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 begin,int end){
int num=0;
if(begin>=end){
return 1;
}
for(int i=begin;i<=end;i++){
num+=numTrees(begin,i-1)*numTrees(i+1,end);
}
return num;
}
int numTrees(int n) {
if(n<=0){
return 0;
}
return numTrees(1,n);
}
};