力扣95 不同的二叉搜索树II

1、https://leetcode-cn.com/problems/unique-binary-search-trees-ii/solution/xiang-xi-tong-su-de-si-lu-fen-xi-duo-jie-fa-by-2-7/

先来构建一棵二叉搜索树
TreeNode* helper(int start,int end)
{
    if(start > end)return nullptr;
    int val = (start + end)/2;
    TreeNode* root = new TreeNode(val);

    root->left = helper(start,val-1);
    root->right = helper(val+1,end);

    return root;
}

 构建一颗平衡二叉搜索树这里有点像前中后序遍历要记住

https://leetcode-cn.com/problems/balance-a-binary-search-tree/submissions/

这道题就是一道构建二叉搜索树的题

在做下面这个的递归就就简单一些了

/**
 * 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) {
        if(!n) return {};
        return generateTrees(1,n);
    }
    vector<TreeNode*> generateTrees(int start, int end)
    {
        if(start > end)return {nullptr};
        vector<TreeNode*>alltree;
        for(int i = start; i <= end; i++)
        {
            vector<TreeNode*>lefttree = generateTrees(start,i-1);
            vector<TreeNode*>righttree = generateTrees(i+1,end);
            for(auto&left : lefttree)
            {
                for(auto&right : righttree)
                {
                    TreeNode* currtree = new TreeNode(i);
                    currtree->left = left;
                    currtree->right = right;
                    alltree.emplace_back(currtree);
                }
            }
        }
        return alltree;

    }
};

n = 3

I = 1的时候

lefttree = generateTrees(1,0);return {nullptr};

righttree = generateTrees(2,3);

///

对于righttree = generateTrees(2,3);

I = 2的时候

lefttree = generateTrees(2,1);return {nullptr};

righttree = generateTrees(3,3);2->3

I = 3的时候

lefttree = generateTrees(2,2);3->2

righttree = generateTrees(4,3);return {nullptr};

///

所以1-->2->3

1->3->2