给定一个整数 n,生成所有由 1 ... n 为节点所组成的二叉搜索树。
示例:
输入: 3
输出:
[
[1,null,3,2],
[3,2,null,1],
[3,1,null,null,2],
[2,1,3],
[1,null,2,null,3]
]
解释:
以上的输出对应以下 5 种不同结构的二叉搜索树:
1 3 3 2 1
\ / / / \ \
3 2 1 1 3 2
/ / \ \
2 1 2 3
/**
* 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) {
if(n == 0) return {};
vector<vector<vector<TreeNode*>>> res(n+1,vector<vector<TreeNode*>>(n+1));
return helper(1,n,res);
}
vector<TreeNode *> helper(int start,int end, vector<vector<vector<TreeNode*>>>& res)
{
if(start > end)
return {nullptr};
if(!res[start][end].empty())
return res[start][end];
vector<TreeNode * > ss;
for(int i = start;i <= end;i++)
{
auto left = helper(start,i-1,res);
auto right = helper(i + 1,end,res);
for(auto a : left)
{
for(auto b:right)
{
TreeNode * t = new TreeNode(i);
t->right = b;
t->left = a;
ss.push_back(t);
}
}
}
return res[start][end] = ss;
}
};