429. N 叉树的层序遍历

429. N 叉树的层序遍历

题目描述

解题思路

1、正常层次遍历加一个循环遍历N个孩子节点

代码实现

"""
# 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 root is None:
            return []
        queue = [root]
        res = []
        while queue:
            size = len(queue)
            lel_val = []
            for i in range(size):
                node = queue.pop(0)
                lel_val.append(node.val)
                for child_node in node.children:
                    queue.append(child_node)
            if lel_val:
                res.append(lel_val)
        return res