出鞘之剑指offer-第28题 (对称的二叉树)

题目：

实现一个函数，用来判断二叉树是不是对称的。如果一个二叉树和他的镜像二叉树一样，他就是对称的。 

分析一：

 

代码一：

package offer.xzs.twentyone2thirty.twentyeight;

import java.util.Arrays;

public class Demo01 {
    public static void main(String[] args) {
        int[] pre1 = { 8, 6, 5, 7, 6, 7, 5 };
        int[] mid1 = { 5, 6, 7, 8, 7, 6, 5 };
        BinaryTree tree1 = build(pre1, mid1);
        preShow(tree1);
        System.out.println();
        boolean b = judgeBalance(tree1);
        System.out.println(b);
    }

    public static boolean judgeBalance(BinaryTree tree) {
        if (tree == null) {
            return true;
        }
        return judgeBalance(tree.getLeft(), tree.getRight());
    }
    public static boolean judgeBalance(BinaryTree tree1, BinaryTree tree2) {
        if (tree1 == null && tree2 == null) {
            return true;
        }
        if (tree1 == null || tree2 == null) {
            return false;
        }
        if (tree1.getValue() != tree2.getValue()) {
            return false;
        }
        return judgeBalance(tree1.getLeft(), tree2.getRight()) && judgeBalance(tree1.getRight(), tree2.getLeft());
    }

    //建二叉树
    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());
        }

    }
}