Unique Binary Search Trees II



Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.

For example,
Given n = 3, your program should return all 5 unique BST's shown below.

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<TreeNode *> generateTrees(int n) {
        vector<TreeNode *> allTrees = generateTrees(1,n);
        return allTrees;
    }
    
private:
   vector<TreeNode *> generateTrees(int low,int high){
        vector<TreeNode *> allTrees;
        if(low > high) {
            allTrees.push_back(NULL);
            return allTrees;
        }
        if(low == high){
            TreeNode *p = new TreeNode(low);
            allTrees.push_back(p);
            return allTrees;
        }
        for(int i = low ;i <= high ; ++i){
            vector<TreeNode *> leftTrees = generateTrees(low,i-1);//把i当做根节点的值,leftTrees表示所有可能的左子树根节点
            vector<TreeNode *> rightTrees = generateTrees(i+1,high);//把i当做根节点的值,rightTrees表示所有可能的右子树根节点
            for(int j=0;j<leftTrees.size();++j){
                for(int k=0;k<rightTrees.size();++k){
                    TreeNode* root = new TreeNode(i);//i作为根节点的值
                    root->left = leftTrees[j];
                    root->right = rightTrees[k];
                    allTrees.push_back(root);
                }
            }
        }
        return allTrees;
   }
};

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值