【LeetCode】73. Unique Binary Search Trees II

题目描述(Medium)

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

题目链接

https://leetcode.com/problems/unique-binary-search-trees-ii/description/

Example 1:

Input: 3
Output:
[
  [1,null,3,2],
  [3,2,null,1],
  [3,1,null,null,2],
  [2,1,3],
  [1,null,2,null,3]
]
Explanation:
The above output corresponds to the 5 unique BST's shown below:

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

算法分析

当数组为1,2,3,...,n时，基于以下原则构建的BST树具有唯一性：以i为根节点的树，其左子树由[1, i-1]构成，其右子树由[i+1,n]构成。

提交代码：

class Solution {
public:
    vector<TreeNode*> generateTrees(int n) {
        if (n == 0) return vector<TreeNode*>();
        return generate(1, n);
    }
    
    vector<TreeNode*> generate(int start, int end) {
        vector<TreeNode*> subTree;
        if(start > end)
        {
            subTree.push_back(NULL);
            return subTree;
        }
        
        for (int k = start; k <= end; ++k)
        {
            vector<TreeNode*> leftTree = generate(start, k - 1);
            vector<TreeNode*> rightTree = generate(k + 1, end);
            
            for (auto i : leftTree)
                for (auto j : rightTree)
                {
                    TreeNode* node = new TreeNode(k);
                    node->left = i;
                    node->right = j;
                    subTree.push_back(node);
                }
        }
        
        return subTree;
    }
};