N-ary Tree Level Order Traversal LeetCode solution in Python

1
class Solution:
2
    def levelOrder(self, root: "Node") -> List[List[int]]:
3
        if not root:
4
            return []
5

6
        result = []
7
        level = [root]
8

9
        while level:
10
            current_level = []
11
            next_level = []
12

13
            for node in level:
14
                current_level.append(node.val)
15
                next_level += node.children
16

17
            result.append(current_level)
18
            level = next_level
19

20
        return result