95. 不同的二叉搜索树 II
【题目】:
【代码】:分治法,递归求出左子树集和右子树集,然后再构造根节点。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<TreeNode> generateTrees(int n) {
if(n<1){
return new LinkedList<TreeNode>();
}
return generateSubtrees(1,n);
}
private List<TreeNode> generateSubtrees(int s, int e) {
List<TreeNode> res=new LinkedList<TreeNode>();
if(s>e){
res.add(null);
return res;
}
for(int i=s; i<=e; i++){
List<TreeNode> left=generateSubtrees(s, i-1);
List<TreeNode> right=generateSubtrees(i+1, e);
for(TreeNode l: left){
for(TreeNode r: right){
TreeNode root=new TreeNode(i);
root.left=l;
root.right=r;
res.add(root);
}
}
}
return res;
}
}
效果: