Unique Binary Search Trees II

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