[leetcode]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

分析：递归，将每个数字作为根节点，小于他数字建立左子树，大于他的数字建立右子树。

代码：

/**
 * 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) {
        vector<TreeNode*> ret;
        if(n==0) return ret;
        return helper(1,n);
    }
    vector<TreeNode*> helper(int begin,int end){
        vector<TreeNode*> ret;
        if(begin>end){
            ret.push_back(NULL);
        }
        else if(begin==end){
            TreeNode* node=new TreeNode(begin);
            ret.push_back(node);
        }
        else{
            for(int i=begin;i<=end;i++){
                vector<TreeNode*> left=helper(begin,i-1);
                vector<TreeNode*> right=helper(i+1,end);
                for(int j=0;j<left.size();j++){
                    for(int k=0;k<right.size();k++){
                        TreeNode* root=new TreeNode(i);
                        root->left=left[j];
                        root->right=right[k];
                        ret.push_back(root);
                    }
                }
            }
            
        }
        return ret;
    }
};