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