参考官解:不同的二叉搜索树 II
二叉搜索树: 根节点的值大于左子树所有节点的值,小于右子树所有节点的值,且左子树和右子树也同样为二叉搜索树。
递归啊递归
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<TreeNode*> dfs(int l,int r)
{
vector<TreeNode*> res;
if(l>r) return {nullptr};
for(int i=l;i<=r;i++)
{
vector<TreeNode*> lefttree=dfs(l,i-1);
vector<TreeNode*> righttree=dfs(i+1,r);
for(auto& left: lefttree)
{
for(auto& right: righttree)
{
TreeNode* node=new TreeNode(i);
node->left=left;
node->right=right;
res.push_back(node);
}
}
}
return res;
}
vector<TreeNode*> generateTrees(int n) {
return dfs(1,n);
}
};