LeetCode 솔루션 분류
[9/5] 429. N-ary Tree Level Order Traversal
본문
429. N-ary Tree Level Order Traversal
Medium
2833112Add to ListShareGiven an n-ary tree, return the level order traversal of its nodes' values.
Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).
Example 1:
Input: root = [1,null,3,2,4,null,5,6] Output: [[1],[3,2,4],[5,6]]
Example 2:
Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14] Output: [[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]
Constraints:
- The height of the n-ary tree is less than or equal to
1000 - The total number of nodes is between
[0, 104]
Accepted
235,611
Submissions
335,791
관련자료
-
링크
댓글 1
학부유학생님의 댓글
- 익명
- 작성일
Runtime: 98 ms, faster than 23.21% of Python3 online submissions for N-ary Tree Level Order Traversal.
Memory Usage: 16 MB, less than 50.08% of Python3 online submissions for N-ary Tree Level Order Traversal.
Memory Usage: 16 MB, less than 50.08% of Python3 online submissions for N-ary Tree Level Order Traversal.
"""
# Definition for a Node.
class Node:
def __init__(self, val=None, children=None):
self.val = val
self.children = children
"""
from collections import deque
class Solution:
def levelOrder(self, root: 'Node') -> List[List[int]]:
if not root: return []
queue = deque([root])
res = []
while queue:
curr_level = []
for _ in range(len(queue)):
node = queue.popleft()
curr_level.append(node.val)
for child in node.children:
queue.append(child)
res.append(curr_level)
return res
