题目描述:
给定一个整数 n,生成所有由 1 … n 为节点所组成的 二叉搜索树 。
示例:
输入:3
输出:
[
[1,null,3,2],
[3,2,null,1],
[3,1,null,null,2],
[2,1,3],
[1,null,2,null,3]
]
解释:
以上的输出对应以下 5 种不同结构的二叉搜索树:
1 3 3 2 1
\ / / / \
3 2 1 1 3 2
/ / \
2 1 2 3
思路:
对于1到n 之间的数,都可能来当根节点
当 i 为根节点的时候,求出左树集合和右树集合
最后在进行排列组合
代码如下:
C++:
/**
* 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 start,int end){
if(start>end)
return {NULL};
vector<TreeNode*>res;
for(int i=start;i<=end;i++){
vector<TreeNode*>leftTrees=dfs(start,i-1);
vector<TreeNode*>rightTrees=dfs(i+1,end);
for(auto& left:leftTrees){
for(auto& right:rightTrees){
TreeNode* node=new TreeNode(i);
node->left=left;
node->right=right;
res.push_back(node);
}
}
}
return res;
}
vector<TreeNode*> generateTrees(int n) {
if(n<1)
return {};
return dfs(1,n);
}
};
python:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def dfs(self,start,end):
if(start>end):
return [None]
res=[]
for i in range(start,end+1):
leftTrees=self.dfs(start,i-1)
rightTrees=self.dfs(i+1,end)
for left in leftTrees:
for right in rightTrees:
node=TreeNode(i)
node.left=left
node.right=right
res.append(node)
return res
def generateTrees(self, n: int) -> List[TreeNode]:
if not n:
return []
return self.dfs(1,n)