题目描述
解法:
如果你知道 LeetCode 96. 不同的二叉搜索树 这道题的解法,那么你应该就不陌生下面的代码
/**
* 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*> generateTrees(int n) {
vector<TreeNode*> res;
if (!n) return res;
return build(1, n);
}
vector<TreeNode*> build(int lo, int hi){
vector<TreeNode*> res;
if (lo > hi)
{
res.push_back(nullptr);
return res;
}
for(int i = lo; i <= hi; i++)
{
vector<TreeNode*> left = build(lo, i - 1);
vector<TreeNode*> right = build(i + 1, hi);
for(auto l: left)
{
for (auto r: right)
{
TreeNode* root = new TreeNode(i);
root->left = l;
root->right = r;
res.push_back(root);
}
}
}
return res;
}
};