Leetcode 96：Unique Binary Search Trees

Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1 … n.

Example:

Input: 3
Output:
[
[1,null,3,2],
[3,2,null,1],
[3,1,null,null,2],
[2,1,3],
[1,null,2,null,3]
]
Explanation:
The above output corresponds to the 5 unique BST’s shown below:

C++
vector<TreeNode*> generateTrees(int n) {
        if(n == 0)
            return {};
        return DFS(1,n);
    }  
    vector<TreeNode*> DFS(int start,int end)
    {
        if(start > end)
        {
            return {nullptr};
        }
        vector<TreeNode*> res;
        for(int i = start;i <= end;++i)
        {
            vector<TreeNode*> left = DFS(start,i-1);
            vector<TreeNode*> right = DFS(i+1,end);
            for(int l = 0;l < left.size();++l)
            {
                for(int r = 0;r < right.size();++r)
                {
                    TreeNode* node = new TreeNode(i);
                    node->left = left[l];
                    node->right = right[r];
                    res.push_back(node);
                }
            }
        }
        return res;
    }