LC429. N 叉树的层序遍历

用双端队列比list快很多

def levelOrder(self, root):
        """
        :type root: Node
        :rtype: List[List[int]]
        """
        if not root:
            return []
        res = []
        stack=deque([root])
        while stack:
            level = []
            for i in range(len(stack)):
                node = stack.popleft()
                level.append(node.val)
                for children in node.children:  #这个节点的孩子节点全部加入队列
                    stack.append(children)
            res.append(level)
        return res