剑指offer16--二叉树的镜像处理

package 剑指offer;
/*题目：请完成一个函数，输入一个二叉树，该函数输出它的镜像。*/
public class Test19 {
public static class BinaryTreeNode{
int value;
BinaryTreeNode left;
BinaryTreeNode right;
}

public static void binaryTreeImage(BinaryTreeNode root){
if(root != null){
BinaryTreeNode tmp = root.left;
root.left = root.right;
root.right = tmp;

// 对结点的左右两个子树进行处理
binaryTreeImage(root.left);
binaryTreeImage(root.right);
}
}

public static void printTree(BinaryTreeNode node) {
if (node != null) {
printTree(node.left);
System.out.print(node.value + " ");
printTree(node.right);
}
}

public static void main(String args[]){
//       8
//    /    \
//   6     10
//  / \   / \
// 5   7 9  11
BinaryTreeNode root = new BinaryTreeNode();
root.value = 8;
root.left = new BinaryTreeNode();
root.left.value = 6;
root.left.left = new BinaryTreeNode();
root.left.left.value = 5;
root.left.right = new BinaryTreeNode();
root.left.right.value = 7;
root.right = new BinaryTreeNode();
root.right.value = 10;
root.right.left = new BinaryTreeNode();
root.right.left.value = 9;
root.right.right = new BinaryTreeNode();
root.right.right.value = 11;
printTree(root);
System.out.println();
binaryTreeImage(root);
printTree(root);
}
}