leetcode101. 对称二叉树

class Solution {
    public boolean isSymmetric(TreeNode root) {
        return isEqual(root.left,root.right);
    }

    public boolean isEqual(TreeNode left,TreeNode right){
        //遍历到空指针，代表当前左右子树遍历结束，返回true
        if(left==null && right == null)
            return true;
        //以下两种情况说明有遍历到了不相同的节点，返回false
        if(left == null || right == null)
            return false;
        if(left.val != right.val)
            return false;
        //递归
        boolean leftFlag = isEqual(left.left,right.right);
        boolean rightFlag = isEqual(left.right,right.left);
        return leftFlag&&rightFlag;
    }
}