- 不同的二叉搜索树 II
给定一个整数 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
提示:
0 <= n <= 8
思路:
i枚举1~n当根结点,左子树就是1 ~ i-1 ,右子树就是i+1 ~ n
难点在于如何存储每棵树,看了别人的解析后,知道,左子树可能有多个,
右子树也可能有多个,左子树和右子树两两匹配,使用vector存放左右子树
然后两两匹配
class Solution {
public:
vector<TreeNode *> res;
vector<TreeNode*> generateTrees(int n) {
return build(1, n);
}
vector<TreeNode*> build(int lo, int hi){
if (lo > hi){
return{ NULL };
}
vector<TreeNode*> ans;
if (lo == hi){
TreeNode* tree = new TreeNode(lo);
ans.push_back(tree);
return ans;
}
for (int i = lo; i <= hi; i++){
vector<TreeNode*> leftTree = build(lo, i - 1); //左子树的集合
vector<TreeNode*> rightTree = build(i + 1, hi); //所有右子树的集合
//两两匹配
for (auto& left : leftTree){
for (auto& right : rightTree){
TreeNode* r = new TreeNode(i, left, right);
ans.push_back(r);
}
}
}
return ans;
}
};
class Solution {
public:
vector<TreeNode *> res;
vector<TreeNode*> generateTrees(int n) {
if (n == 0) res;
return build(1, n);
}
vector<TreeNode*> build(int lo, int hi){
if (lo > hi){
return{ NULL };
}
vector<TreeNode*> ans;
if (lo == hi){
TreeNode* tree = new TreeNode(lo);
ans.push_back(tree);
return ans;
}
for (int i = lo; i <= hi; i++){
vector<TreeNode*> leftTree = build(lo, i - 1); //左子树的集合
vector<TreeNode*> rightTree = build(i + 1, hi); //所有右子树的集合
//两两匹配
for (auto& left : leftTree){
for (auto& right : rightTree){
TreeNode* r = new TreeNode(i, left, right);
ans.push_back(r);
}
}
}
return ans;
}
};