95. 不同的二叉搜索树 II - 力扣(LeetCode) (leetcode-cn.com)
左边的节点都可以作为根节点,形成左子树的情况:left_nodes=generate(left,i-1);
右边同理:right_nodes=generate(i+1,right);
所以当前节点i生成树的情况有left_nodes.size()*right_nodes.size()种情况。
/**
* 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 generate(1,n);
else return vector<TreeNode*>();
}
vector<TreeNode*>generate(int left,int right){
vector<TreeNode*> ans;
if(left>right){
ans.push_back(nullptr);
return ans;
}
for(int i=left;i<=right;i++){
vector<TreeNode*>left_nodes=generate(left,i-1);
vector<TreeNode*>right_nodes=generate(i+1,right);
for(TreeNode *left_node:left_nodes){
for(TreeNode*right_node:right_nodes){
TreeNode *t=new TreeNode(i);
t->left=left_node;
t->right=right_node;
ans.push_back(t);
}
}
}
return ans;
}
};