leetcode刷题(python)10.层序遍历&226.翻转二叉树&101.对称二叉树

吟咏十

已于 2023-10-27 00:30:33 修改

阅读量49

点赞数

分类专栏： Leetcode小白刷题文章标签： leetcode python 算法

于 2023-10-27 00:28:27 首次发布

本文链接：https://blog.csdn.net/qq_36012085/article/details/134067587

版权

Leetcode小白刷题专栏收录该内容

12 篇文章 0 订阅

订阅专栏

10.层序遍历

# 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]]:
        if not root:
            return []
        result = []
        queue = collections.deque([root])
        while queue:
            level = []
            for i in range(len(queue)):
                node = queue.popleft()
                level.append(node.val)
                if node.left:
                    queue.append(node.left)
                if node.right:
                    queue.append(node.right)
            result.append(level)
        return result

构造队列解决，使用先序遍历或者后序遍历较简单

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

使用先序遍历，中左右，运用递归法

01.对称二叉树

# 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:
        if not root:
            return True
        return self.compare(root.left,root.right)
    def compare(self,left,right):
        if left==None and right==None:
            return True
        elif left==None and right!=None:
            return False
        elif left!=None and right==None:
            return False
        elif left.val!=right.val:
            return False
        outside = self.compare(left.left,right.right)
        inside = self.compare(left.right,right.left)
        isname = outside and inside
        return isname

使用后序遍历，递归法解决问题