要求:从1到n组合二叉搜索树
思路:分治,从1到n遍历保证了二叉搜索树
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<TreeNode*> generateTrees(int n) {
return generateTrees(1,n);
}
vector<TreeNode*> generateTrees(int start,int end){
vector<TreeNode*> ans;
if(start>end)return {nullptr};
for(int i=start;i<=end;i++){
//分
vector<TreeNode*> left=generateTrees(start,i-1);
vector<TreeNode*> right=generateTrees(i+1,end);
//合并
for(TreeNode* &l:left){
for(TreeNode* &r:right){
TreeNode* root=new TreeNode(i,l,r);
ans.push_back(root);
}
}
}
return ans;
}
};