力扣的对称二叉树解法（Python3）

力扣的对称二叉树解法

题目描述：
给定一个二叉树，检查它是否是镜像对称的。

例如，二叉树 [1,2,2,3,4,4,3] 是对称的。

1

/
2 2
/ \ /
3 4 4 3
但是下面这个 [1,2,2,null,3,null,3] 则不是镜像对称的:

1

/
2 2
\
3 3
说明:

如果你可以运用递归和迭代两种方法解决这个问题，会很加分。

来源于力扣

参考程序1：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

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

运行结果1：

参考程序2：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

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

运行结果2：

参考程序3：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def isSymmetric(self, root: TreeNode) -> bool:
        if root is None:
            return True        
        return self.isST(root.left, root.right)     # 分成左子树和右子树判断
    def isST(self, p, q):                           # 判断两棵树是否是镜像树
        if not p and not q:                         # 根节点都为空，是
            return True
        if not p or not q:                          # 其中有一棵为空，不是
            return False
        left = self.isST(p.left, q.right)           # p的左子树和q的右子树是否相同
        right  = self.isST(p.right, q.left)         # p的右子树和q的左子树是否相同
        return p.val == q.val and left and right    # 值相等，并且p的左=q的右，p的右=q的左

运行结果3：