LeetCode95. Unique Binary Search Trees II（C++）

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

解题思路：递归建立BST，假设根节点取 i ，就有左子树为left到i-1，右子树节点为i+1到right，然后递归建立左子树和右子树。

/**
 * 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 myGenerateTrees(1, n);
    }
    vector<TreeNode*> myGenerateTrees(int left, int right){
        vector<TreeNode*>ans;
        if(left > right){
            ans.push_back(NULL);
            return ans;
        }
        for(int i = left; i <= right; ++ i){
            vector<TreeNode*>leftChild = myGenerateTrees(left, i - 1);
            vector<TreeNode*>rightChild = myGenerateTrees(i + 1, right);
            for(int u = 0; u < leftChild.size(); ++ u)
                for(int v = 0; v < rightChild.size(); ++ v){
                    TreeNode *root = new TreeNode(i);
                    root->left = leftChild[u];
                    root->right = rightChild[v];
                    ans.push_back(root);
                }
        }
        return ans;
    }
};