代码随想录day15|层序遍历226.翻转二叉树101. 对称二叉树-CSDN博客

本文链接：https://blog.csdn.net/weixin_44529258/article/details/132230864

# 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 levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
        result = []
        queue = []
        if root != None:
            queue.append(root)
        while queue != []:
            size = len(queue)
            vec = []
            for _ in range(size):
                temp = queue.pop(0)
                vec.append(temp.val)
                if temp.left:
                    queue.append(temp.left)
                if temp.right:
                    queue.append(temp.right)
            result.append(vec)
        return result

107. 二叉树的层序遍历 II

199. 二叉树的右视图

515. 在每个树行中找最大值

116. 填充每个节点的下一个右侧节点指针

117. 填充每个节点的下一个右侧节点指针 II

104. 二叉树的最大深度

111. 二叉树的最小深度

以上题目略

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]:
        def invert(cur):
            if cur ==None:
                return
            cur.left,cur.right = cur.right,cur.left
            invert(cur.left)
            invert(cur.right)
        invert(root)
        return root

101. 对称二叉树

# 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: Optional[TreeNode]) -> bool:
        def compare(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 = compare(left.left,right.right)
                inside = compare(left.right,right.left)
                return outside and inside
        
        result = compare(root.left,root.right)
        return result