*python3__leecode/0101.对称二叉树

一、刷题内容

原题链接

https://leetcode-cn.com/problems/symmetric-tree/

内容描述

给定一个二叉树，检查它是否是镜像对称的。
例如，二叉树 [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, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def isSymmetric(self, root: TreeNode) -> bool:
        if root is None:
            return True
        return self.isSL(root.left,root.right)

    def isSL(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.isSL(left.left,right.right) and self.isSL(left.right,right.left)

2.方法二：递归

class Solution:
    def isSymmetric(self, root: TreeNode) -> bool:
        if root is None:
            return True
        def isSL(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 isSL(p.left,q.right) and isSL(p.right,q.left)
            else:
                return False
        return isSL(root.left,root.right)

3.方法三：递归

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的左