095 Unique Binary Search Trees II [Leetcode]

题目内容：

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

和上一题一样，递归构造给定范围的左右子树集，最后把左右子树加到根节点上放入树的集合。

代码如下，运行时间24ms。中间包含了一些重复计算，应该还有更加优化的方法。

/**
 * 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) {
        return generateTree(1, n);
    }

    vector<TreeNode*> generateTree(int start, int end) {
        vector<TreeNode*> trees;
        if(start > end) {
            trees.push_back(NULL);
            return trees;
        }
        if(start == end) {
            TreeNode* node = new TreeNode(start);
            trees.push_back(node);
            return trees;
        }

        TreeNode* root;
        for(int i = start; i <= end; ++i) {
            vector<TreeNode*> left_trees = generateTree(start, i-1);
            vector<TreeNode*> right_trees = generateTree(i+1, end);
            for(int m = 0; m < left_trees.size(); ++m) {
                for(int n = 0; n < right_trees.size(); ++n) {
                    root = new TreeNode(i);
                    root->left = left_trees[m];
                    root->right = right_trees[n];
                    trees.push_back(root);
                }
            }
        }

        return trees;
    }
};