429 N叉树的层序遍历

429 N叉树的层序遍历

给定一个 N 叉树，返回其节点值的层序遍历。（即从左到右，逐层遍历）。

树的序列化输入是用层序遍历，每组子节点都由 null 值分隔（参见示例）。

输入：root = [1,null,3,2,4,null,5,6]
输出：[[1],[3,2,4],[5,6]]

输入：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]
输出：[[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]

"""
# 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]]:
        # 非递归
        # results = []
        # if not root:
        #     return []
        # # from collections import deque
        # que = deque([root])
        # while que:
        #     result = []
        #     for i in range(len(que)):
        #         cur = que.popleft()
        #         result.append(cur.val)
        #         for child in cur.children:
        #             que.append(child)
        #     results.append(result)
        # return results
        # 递归
        res = []
        if not root:
            return []
        def helper(root, depth):
            if len(res) == depth:res.append([])
            res[depth].append(root.val)
            for child in root.children:
                helper(child, depth+1)
        helper(root, 0)
        return res