不同的二叉查找树 II

最新推荐文章于 2023-09-17 08:57:12 发布

俺也一样

最新推荐文章于 2023-09-17 08:57:12 发布

阅读量68

点赞数

分类专栏： LintCode

本文链接：https://blog.csdn.net/weixin_41791402/article/details/100064796

版权

LintCode 专栏收录该内容

404 篇文章 4 订阅

订阅专栏

给出n，生成所有由1...n为节点组成的不同的二叉查找树

样例

样例 1:

输入:3
输出:
    1         3     3       2    1
     \       /     /       / \    \
      3     2     1       1   3    2
     /     /       \                \
    2     1         2                3

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @paramn n: An integer
     * @return: A list of root
     */
    vector<TreeNode *> generateTrees(int n) {
        // write your code here
        vector<TreeNode *> res;
        if (n == 0) 
        {
            res.push_back(NULL);
            return res;
        }
           
        return helper(1, n);
        
    }
    
     vector<TreeNode*> helper(int left, int right) 
    {
        vector<TreeNode*> res;
        if(left > right)
        {
            res.push_back(NULL);
            return res;
        }
        
        for(int i = left; i <= right; i++)
        {
            vector<TreeNode*> leftTree = helper(left, i-1);
            vector<TreeNode*> rightTree = helper(i+1, right);
            for(auto tree1 : leftTree)
            {
                for(auto tree2 : rightTree)
                {
                    TreeNode* root = new TreeNode(i);
                    root->left = tree1;
                    root->right = tree2;    
                    res.push_back(root);
                }
            }
        }
        return res;
    }
};