剑指Offer 对称的二叉树

import hsx.jianzhi.util.TreeNode;

/**
 * 对称的二叉树
 *
 * 请实现一个函数，用来判断一棵二叉树是不是对称的。注意，如果一个二叉树同此二叉树的镜像是同样的，定义其为对称的。
 */
public class JZ058IsSymmetrical {

    public static boolean isSymmetrical(TreeNode pRoot) {

        return isSymmetricalCore(pRoot, pRoot);
    }

    public static boolean isSymmetricalCore(TreeNode root1, TreeNode root2) {

        if (root1 == null && root2 == null) {
            return true;
        }
        if (root1 == null || root2 == null) {
            return false;
        }

        if (root1.val != root2.val) {
            return false;
        }

        return isSymmetricalCore(root1.left, root2.right) && isSymmetricalCore(root1.right, root2.left);
    }

    public static void main(String[] args) {

        TreeNode root = new TreeNode(1);
        TreeNode firstLeftNode = new TreeNode(2);
        TreeNode firstRightNode = new TreeNode(2);
        root.left = firstLeftNode;
        root.right = firstRightNode;
        TreeNode secondLeftNode1 = new TreeNode(3);
        TreeNode secondLeftNode2 = new TreeNode(4);
        firstLeftNode.left = secondLeftNode1;
        firstLeftNode.right = secondLeftNode2;
        TreeNode secondRightNode1 = new TreeNode(4);
        TreeNode secondRightNode2 = new TreeNode(4);
        firstRightNode.left = secondRightNode1;
        firstRightNode.right = secondRightNode2;

        System.out.println(isSymmetrical(root));

    }


}