/**
* 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) { return f(1, n); }
vector<TreeNode*> f(int l, int r) {
if (l > r)
return {nullptr};
vector<TreeNode*> ans;
for (int i = l; i < r + 1; ++i) {
for (auto& left : f(l, i - 1)) {
for (auto& right : f(i + 1, r)) {
TreeNode* root = new TreeNode(i);
root->left = left;
root->right = right;
ans.emplace_back(root);
}
}
}
return ans;
}
};
简单题目 练语法