leetcode question 95: Unique Binary Search Trees II

题目：

Given an integer 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

一分钟讲解思路：

这道题和第96题类似，只不过是要求我们把树画出来。这里使用DP算法，第96题使用DP算法会报超时，这里并不会。

简单来说，就是依次以各个节点为根节点，构建左右两棵子树（包括空子树），此处就是通过解决子集的问题来解决目标问题。返回的左右子树交叉组合，最后得到目标二叉搜索树的集合。

代码如下：

/**
 * 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 ){
            vector<TreeNode*> res;
            return res;
        }
        return genearateTree(1,n);
    }
    
    vector<TreeNode*> genearateTree(int start, int end) {
        vector<TreeNode*> res;
        vector<TreeNode*> tmpVec;
        TreeNode *cur;
        if (start > end) {
            res.push_back(NULL);
            return res;
        }
        for (int i = start; i <= end; i++) {
            vector<TreeNode*> left = genearateTree(start, i-1);
            vector<TreeNode*> right = genearateTree(i + 1, end);
            for (int j1 = 0; j1 < left.size(); j1++) {
                for (int j2 = 0; j2 < right.size(); j2++) {
                    TreeNode* cur = new TreeNode(i);
                    cur->left = left[j1];
                    cur->right = right[j2];
                    res.push_back(cur);
                }
            }
        }
        return res;
    }
};