Unique Binary Search Trees II

最新推荐文章于 2021-09-11 12:08:06 发布

zzyazzy

最新推荐文章于 2021-09-11 12:08:06 发布

阅读量440

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/zzyafyj/article/details/41652739

本文介绍了一种算法，用于根据给定数值n生成所有结构上唯一的二叉搜索树（BST），这些树存储从1到n的值。通过递归地构造左右子树并组合它们来创建不同的BST结构。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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;
   }
};