# Definition for a binary tree node.# class TreeNode:# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclassSolution:defisSymmetric(self, root: Optional[TreeNode])->bool:defcompare(left,right):if left ==Noneand right !=None:returnFalseelif left ==Noneand right ==None:returnTrueelif left !=Noneand right ==None:returnFalseelif left.val != right.val:returnFalse
outside = compare(left.left, right.right)
inside = compare(left.right,right.left)return outside and inside
return compare(root.left, root.right)