题目
给定一个整数 n,生成所有由 1 ... n 为节点所组成的二叉搜索树。
【二叉查找树(Binary Search Tree),(又:二叉搜索树,二叉排序树)它或者是一棵空树,或者是具有下列性质的二叉树: 若它的左子树不空,则左子树上所有结点的值均小于它的根结点的值; 若它的右子树不空,则右子树上所有结点的值均大于它的根结点的值; 它的左、右子树也分别为二叉排序树。】
示例:
输入: 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
解法
/**
* 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) {
List<TreeNode> list = new ArrayList<>();
if(n <= 0){
return list;
}
TreeNode head =new TreeNode(1);
List<Integer> choose = new ArrayList<>();
choose.add(1);
add(list,head, n, choose);
return list;
}
public void add(List<TreeNode> list,TreeNode head,int n,List<Integer> choose){
if(choose.size() == n){
for(TreeNode h : list){
if(h.val == head.val){
if(isEquals(h, head)){
return;
}
}
}
list.add(head);
return;
}
for(int i = 1; i <= n; i++){
if(!choose.contains(i)){
//可添加到头结点
if(i > head.val && head.right == null){
TreeNode h = new TreeNode(i);
h.left = copyTree(head);
List<Integer> l = new ArrayList<>();
l.addAll(choose);
l.add(i);
add(list, h, n,l);
}
//寻找可添加的子节点
TreeNode h = copyTree(head);
addChild(h,i);
List<Integer> l = new ArrayList<>();
l.addAll(choose);
l.add(i);
add(list, h, n,l);
}
}
}
//添加子节点
private void addChild(TreeNode head,int n){
if(n > head.val){
if(head.right == null){
head.right = new TreeNode(n);
}else{
addChild(head.right, n);
}
}else{
if(head.left == null){
head.left = new TreeNode(n);
}else{
addChild(head.left, n);
}
}
}
//判断两个树是否一样
private boolean isEquals(TreeNode n1, TreeNode n2){
if(n1 == null && n2 == null){
return true;
}
if(n1 == null || n2 == null){
return false;
}
if(n1.val != n2.val){
return false;
}
return (isEquals(n1.left, n2.left) && isEquals(n1.right, n2.right));
}
//复制原来的树
private TreeNode copyTree(TreeNode node) {
if (node == null)
return null;
TreeNode newHead = new TreeNode(node.val);
newHead.left = copyTree(node.left);
newHead.right = copyTree(node.right);
return newHead;
}
}