Leetcode95. 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

---

和上一题很像，上一题需要找到有多少个二叉搜索树，而这一题是把所有搜索树列出。

还是不太习惯用指针，但这个需要慢慢习惯，等到把leetcode上所有的树的题目刷完应该差不多可以了。

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