[LeetCode] Unique Binary Search Trees II （难以忍受的递归）

class Solution {
private:
    vector<TreeNode*> generateTreesRec(int start, int end){
        vector<TreeNode*> v;
        if(start > end){
            v.push_back(NULL);
            return v;
        }
        for(int i = start; i <= end; ++i){
            vector<TreeNode*> left = generateTreesRec(start, i - 1);
            vector<TreeNode*> right = generateTreesRec(i + 1, end);
            TreeNode *node;
            for(int j = 0; j < left.size(); ++j){
                for(int k = 0; k < right.size(); ++k){
                    node = new TreeNode(i);
                    node->left = left[j];
                    node->right = right[k];
                    v.push_back(node);
                }
            }
        }
        return v;
    }
public:
    vector<TreeNode *> generateTrees(int n) {
        return generateTreesRec(1, n);
    }
};