剑指offer：对称的二叉树（java）

/**
 * 题目：
 *      请实现一个函数，用来判断一颗二叉树是不是对称的。
 *      注意，如果一个二叉树同此二叉树的镜像是同样的，定义其为对称的。
 *
 */
public class P159_IsSymmerical {
    boolean isSymmetrical(TreeNode pRoot)
    {
        if (pRoot == null) {
            return true;
        }
        return Symmerical(pRoot.left, pRoot.right);
    }

    public boolean Symmerical(TreeNode left, TreeNode right) {
        if (left == null && right == null) {
            return true;
        }

        if (left != null && right == null || left == null && right != null) {
            return false;
        }
        return left.val == right.val && Symmerical(left.left, right.right) && Symmerical(left.right, right.left);
    }

    public static void main(String[] args) {
        TreeNode node1 = new TreeNode(8);

        TreeNode node2 = new TreeNode(6);
        node1.left = node2;

        TreeNode node3 = new TreeNode(6);
        node1.right = node3;

        TreeNode node4 = new TreeNode(5);
        node2.left = node4;

        TreeNode node5 = new TreeNode(7);
        node2.right = node5;

        TreeNode node6 = new TreeNode(7);
        node3.left = node6;

        TreeNode node7 = new TreeNode(5);
        node3.right = node7;

        P159_IsSymmerical test = new P159_IsSymmerical();
        boolean result = test.isSymmetrical(node1);
        System.out.print(result);
    }
}