出鞘之剑指offer-第27题 (二叉树的镜像)

题目：

输入一棵二叉树，输出他的镜像。 

分析一：

 

代码一：

package offer.xzs.twentyone2thirty.twentyseven;

import java.util.Arrays;

public class Demo01 {
    public static void main(String[] args) {
        int[] pre1 = { 8, 8, 9, 2, 4, 7, 7 };
        int[] mid1 = { 9, 8, 4, 2, 7, 8, 7 };
        BinaryTree tree1 = build(pre1, mid1);
        preShow(tree1);
        System.out.println();
        getMirro(tree1);
        preShow(tree1);
        System.out.println();
    }

    public static void getMirro(BinaryTree tree) {
        if (tree == null) {
            return;
        }
        swap(tree);
        getMirro(tree.getLeft());
        getMirro(tree.getRight());
    }

    private static void swap(BinaryTree tree) {
        BinaryTree temp = tree.getLeft();
        tree.setLeft(tree.getRight());
        tree.setRight(temp);
    }

    //建二叉树
    public static BinaryTree build(int[] preList, int[] midList) {
        if (preList == null || preList.length == 0 || midList == null || midList.length == 0 || preList.length != midList.length) {
            return null;
        }
        BinaryTree root = new BinaryTree(preList[0]);
        for (int i = 0; i < preList.length; i++) {
            if (preList[0] == midList[i]) {
                root.setLeft(build(Arrays.copyOfRange(preList, 1, i + 1), Arrays.copyOfRange(midList, 0, i)));
                root.setRight(build(Arrays.copyOfRange(preList, i + 1, preList.length), Arrays.copyOfRange(midList, i + 1, midList.length)));
            }
        }
        return root;
    }
    //先序遍历
    public static void preShow(BinaryTree root) {
        if (root == null) {
            return;
        }
        System.out.printf("%d\t", root.getValue());
        if (root.getLeft() != null) {
            preShow(root.getLeft());
        }
        if (root.getRight() != null) {
            preShow(root.getRight());
        }

    }
}