429. N-ary Tree Level Order Traversal - LeetCode Solution

"""
# 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 []
        
        ans = []
        q = []
        
        q.append(root)
        q.append(None)
        count = 0
        

        
        s = []
        
        while count < 2:
            k = q.pop(0)
            
            if not k:

                count+=1

                ans.append(s)
                s = []
                q.append(None)
                
            else:
                
                s.append(k.val)
                count = 0

                for i in range(len(k.children)):
                    q.append(k.children[i])
                
        
        return ans[:len(ans) -1]