leetcode-对称二叉树

class Solution:
    def isSymmetric(self, root: Optional[TreeNode]) -> bool:

        def isSymmetricHelper(left, right):
            # 如果左右节点均为空，返回 True
            if not left and not right:
                return True
            # 如果左右节点中有一个为空，或者节点值不相等，返回 False
            if not left or not right or left.val != right.val:
                return False
            # 递归比较左节点的左子树和右节点的右子树，以及左节点的右子树和右节点的左子树
            return isSymmetricHelper(left.left, right.right) and isSymmetricHelper(left.right, right.left)

        # 如果根节点为空，返回 True
        if not root:
            return True
        # 调用辅助函数进行判断
        return isSymmetricHelper(root.left, root.right)