【LeetCode】101. Symmetric Tree Python3解法

题目描述：

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

    1
   / \
  2   2
 / \ / \
3  4 4  3

But the following [1,2,2,null,3,null,3] is not:

    1
   / \
  2   2
   \   \
   3    3

Note:
Bonus points if you could solve it both recursively and iteratively.

思路：

先判断root是否为空，再写一个函数检查左右子树是否有镜面对称。可以发现我们要判断的条件是左子树的左子树和右子树的右子树是否相等，左子树的右子树和右子树的左子树是否相等。当我们了解了对比规则之后就很好完成了。

代码：

class Solution:
    def isSymmetric(self, root: TreeNode) -> bool:
        if root is None:
            return True
        return self.check(root.left,root.right)
    
    def check(self,left,right):
        if left is None and right is None:
            return True
        
        if  left is not None and right is not None and left.val == right.val:
            return self.check(left.left,right.right) and self.check(left.right,right.left)
        else:
            return False