《剑指offer》NO28 对称的二叉树 详解 ＜Java实现＞

public boolean isMirror(TreeNode root)
    {
        //先去判断根节点是否为空,再重载方法去判断子节点.
        if (root == null)
            return true;

        return isMirror(root.left,root.right);
    }
    public boolean isMirror(TreeNode left,TreeNode right)
    {
        //递归出口
        //1.都为空则返回true
        if (left == null && right == null)
            return true;
        //2.只有一个为空则返回false
        if (left == null || right == null)
            return false;
        //3.值不相同返回false
        if (left.value != right.value)
            return false;

        //继续去递归,遍历左右子节点.
        return isMirror(left.left,left.right)&& isMirror(right.left,right.right);
    }