"""
# Definition for a Node.
class Node:
def __init__(self, val=None, children=None):
self.val = val
self.children = children
"""
class Solution:
def levelOrder(self, root: 'Node') -> List[List[int]]:
# 长度法
# if not root:
# return []
# result = []
# queue = collections.deque([root])
# while queue:
# level_size = len(queue)
# level = []
# for i in range(level_size):
# node = queue.popleft()
# level.append(node.val)
# for child in node.children:
# queue.append(child)
# result.append(level)
# return result
#迭代法
if not root:
return []
result = []
def traversal(node, depth):
if len(result) == depth:
result.append([])
result[depth].append(node.val)
for child in node.children:
traversal(child, depth + 1)
traversal(root, 0)
return result
429.N叉树的层序遍历
最新推荐文章于 2024-08-26 18:56:03 发布