LeetCode(力扣)102. 二叉树的层序遍历Python

最新推荐文章于 2024-07-25 12:41:30 发布

板砖大的砖头

最新推荐文章于 2024-07-25 12:41:30 发布

阅读量133

点赞数

分类专栏： Python刷题记录文章标签： leetcode python 算法职场和发展

本文链接：https://blog.csdn.net/qq_44953660/article/details/132078796

版权

Python刷题记录专栏收录该内容

54 篇文章 0 订阅

订阅专栏

LeetCode102. 二叉树的层序遍历

- 题目链接
- 代码

题目链接

https://leetcode.cn/problems/binary-tree-level-order-traversal/
在这里插入图片描述

代码

使用队列

# 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]]:
        queue = collections.deque([root])
        result = []
        if not root:
            return []

        while queue:
            level = []
            for _ in range(len(queue)):
                cur = queue.popleft()
                level.append(cur.val)
                if cur.left:
                    queue.append(cur.left)
                if cur.right:
                    queue.append(cur.right)
            result.append(level)
        return result

递归

# 递归法
# 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]]:
        levels = []
        self.helper(root, 0, levels)
        return levels
    
    def helper(self, node, level, levels):
        if not node:
            return
        if len(levels) == level:
            levels.append([])
        levels[level].append(node.val)
        self.helper(node.left, level + 1, levels)
        self.helper(node.right, level + 1, levels)