leetcode -- Unique Binary Search Trees II

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

Example:

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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/unique-binary-search-trees-ii
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

shicheng思路：

1. 先递归求出左子树集和右子树集，然后再构造根节点

 

/**
 * Definition for a binary tree node.
 * 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) {
        if(n==0) return vector<TreeNode*>{};
        return helper(1,n);
    }
    
    vector<TreeNode*> helper(int begin, int end){
        vector<TreeNode*> res;
        if(begin>end){
            res.push_back(NULL);
            return res;
        }
        //对根节点是i的树
        for(int i = begin; i <= end; i++){
            vector<TreeNode*> left_trees = helper(begin, i-1);  //左子树
            vector<TreeNode*> right_trees = helper(i+1, end);  //右子树
            //构造左右子树
            for(auto l:left_trees){
                for(auto r:right_trees){
                    TreeNode* root = new TreeNode(i);
                    root->left = l;
                    root->right = r;
                    res.push_back(root);
                }
            }
        }
        return res;
    }
};