每天一个算法之树镜像

import java.util.Scanner;






class BinaryTree{
int data;
BinaryTree left;
BinaryTree right;
}
public class mirror {
static Scanner sc=new Scanner(System.in);
public static void main(String args[]){
BinaryTree t1=create();
change(t1);
print(t1);
}
public static void print(BinaryTree tree){
if(tree==null)
return;
System.out.print(tree.data+" ");
print(tree.left);
print(tree.right);
}
public static BinaryTree create(){
BinaryTree tree;
int vl=sc.nextInt();
if(vl==-1){
tree=null;
}else{
tree=new BinaryTree();
tree.data=vl;
tree.left=create();
tree.right=create();
}


return tree;
}
//依次把根节点的左右孩子交换，实现镜像需要递归交换
public static void change(BinaryTree tree){
if(tree==null||(tree.left==null&&tree.right==null))
return;
BinaryTree bt=new BinaryTree();
bt=tree.left;
tree.left=tree.right;
tree.right=bt;
change(tree.left);
change(tree.right);
}
}