leetCode_Unique Binary Search Trees II

最新推荐文章于 2020-12-09 16:51:01 发布

码农Crystal

最新推荐文章于 2020-12-09 16:51:01 发布

阅读量282

点赞数

分类专栏： leetCode

本文链接：https://blog.csdn.net/XiaYiZhanQiHang/article/details/51886027

版权

leetCode 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

题意：找出指定节点所有的二叉搜索树

class Solution {
public:
    vector<TreeNode*> generateTrees(int n) {
        vector<TreeNode *>ans;
        if(n==0) return ans;
        return find(1,n);
    }
    vector<TreeNode*> find(int left,int right)
    {
        vector<TreeNode *>ans;
        vector<TreeNode *> ltree;
        vector<TreeNode *> rtree;
        int i,j,k;
        if(left>right) 
        {
            ans.push_back(NULL);
            return ans;
        }
        if(left==right)
        {
            TreeNode * node=new TreeNode(left);
            ans.push_back(node);
            return ans;
        }
        for(i=left;i<=right;i++)
        {
            ltree=find(left,i-1);
            rtree=find(i+1,right);
            for(j=0;j<ltree.size();j++)
            {
                for(k=0;k<rtree.size();k++)
                {
                    TreeNode *node=new TreeNode(i);
                    node->left=ltree[j];
                    node->right=rtree[k];
                    ans.push_back(node);
                }
            }
        }
        return ans;
    }
};