Unique Binary Search Trees II

/**
 * 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 CreateTrees(1,n);
    }
    
    vector<TreeNode*>CreateTrees(int begin,int end)
    {
        vector<TreeNode*> result;
        if(begin>end)
            result.push_back(NULL);

        else
        {
            for(int k=begin;k<=end;++k)
            {
                vector<TreeNode*> leftNodes=CreateTrees(begin,k-1);
                vector<TreeNode*> rightNodes=CreateTrees(k+1,end);
            
                for(int i=0;i<leftNodes.size();++i)
                {
                    for(int j=0;j<rightNodes.size();++j)
                    {
                        TreeNode* root=new TreeNode(k);
                        root->left=leftNodes[i];
                        root->right=rightNodes[j];
                        result.push_back(root);
                    }
                }
            }
        }
        return result;
        
        
    }