Note:
递归搜索,每次新建一个根节点,然后左边所有的可能循环放到左子树,右边的循环放到右子树
代码如下:
/**
* 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) {
if(!n) return {};
return dfs(1, n);
}
vector<TreeNode*> dfs(int l, int r){
if(l > r) return {NULL};
vector<TreeNode*> ans;
for(int i = l; i <= r; i ++){
auto left = dfs(l, i - 1), right = dfs(i + 1, r);
for(auto t : left)
for(auto t1 : right){
auto node = new TreeNode(i);
node -> left = t, node -> right = t1;
ans.push_back(node);
}
}
return ans;
}
};