题目描述
方法思路
class Solution{
public List<TreeNode> generateTrees(int n) {
if(n == 0) return new ArrayList<TreeNode>();
return generateSubTrees(1, n);
}
public List<TreeNode> generateSubTrees(int s, int e){
List<TreeNode> res = new LinkedList<>();
if(s > e){
res.add(null);
return res;
}
for(int i = s; i <= e; i++){
List<TreeNode> leftSubTree = generateSubTrees(s, i - 1);
List<TreeNode> rightSubTree = generateSubTrees(i + 1, e);
for(TreeNode left : leftSubTree){
for(TreeNode right : rightSubTree){
TreeNode root = new TreeNode(i);
root.left = left;
root.right = right;
res.add(root);
}
}
}
return res;
}
}