对称二叉树

判断一个二叉树是否对称

递归法

class Solution:
  def isSymmetric(self,root:TreeNode)->bool:
      if not root:
          return True
      return self.compare(root.left,root.right)
  
  def compare(self,left,right):
      if left == None and right != None: return False
      elif left != None and right == None: return False
      elif left == None and right == None: return True
      elif left.val != right.val: return False
      outside = self.compare(left.left,right.right)
      inside = self.compare (left.right, right.left)
      inSame = outside and inside
      return isSame