代码随想录算法训练营第十五天 |● 226.翻转二叉树 ● 101.对称二叉树 2-CSDN博客

本文链接：https://blog.csdn.net/weixin_44776944/article/details/133149013

226.翻转二叉树

# 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 invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
        if not root:
            return None
        root.left,root.right=root.right,root.left
        self.invertTree(root.left)
        self.invertTree(root.right)
        return root

101.对称二叉树 2
收集孩子的信息返回上一级需要用后序遍历。
遍历顺序非常重要

class Solution:
    def isSymmetric(self, root: Optional[TreeNode]) -> bool:
        if not root:
            return True
        else:
            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
        else:
            outside=self.compare(left.left,right.right)
            inside=self.compare(left.right,right.left)
            same=outside and inside
        return same