class Solution {
public:
vector<TreeNode*> generateTrees(int n) {
vector<TreeNode*> res;
if(n<=0) return res;
res = build(1,n);
return res;
}
vector<TreeNode*> build(int begin,int end){
vector<TreeNode*> res;
if(begin>end) {res.push_back(NULL);return res;}
for(int i=begin;i<=end;i++){
vector<TreeNode*> left = build(begin,i-1);
vector<TreeNode*> right = build(i+1,end);
for(TreeNode* l:left){
for(TreeNode * r:right){
TreeNode * root=new TreeNode(i);
root->left = l;
root->right = r;
res.push_back(root);
}
}
}
return res;
}
};
与95很类似,计算树种类时,建树种数只跟数字个数有关,在建树时,顺序遍历begin到end之间的所有位置,以每一个位置作为根,左侧建左子树,右侧建右子树,然后循环与根连接,加入结果集合即可。