力扣刷题 101. 对称二叉树

var isSymmetric = function(root) {
    const isTrue = (left, right) => {//左右子树是不是镜像
        if(left == null && right == null)return true;//走到了根节点
        if(left == null || right == null)return false;//左右子树有一个不空
        if(left.val != right.val)return false;//对称点相等不相等
        return isTrue(left.left, right.right) && isTrue(left.right, right.left);//子问题
        
    }
    if(root == null)return true;
    return isTrue(root.left, root.right);
};