分治算法题目

---

不同的二叉搜索树 II

解题思路：

递归构建左子树，并拿到左子树所有可能的根结点列表left
递归构建右子树，并拿到右子树所有可能的根结点列表right

/**
 * 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*> process(int left,int right){
        if(left>right)return {nullptr};
        vector<TreeNode*>res;
        for(int i=left;i<=right;++i){
            vector<TreeNode*>l=process(left,i-1);
            vector<TreeNode*>r=process(i+1,right);
            for(TreeNode* ll:l){
                for(TreeNode* rr:r){
                    TreeNode* root=new TreeNode(i);
                    root->left=ll;
                    root->right=rr;
                    res.push_back(root);
                }
            }
        }
        return res;
    }
    vector<TreeNode*> generateTrees(int n) {
        
       return process(1,n);
    }
};

---