Leetcode-429. N-ary Tree Level Order Traversal N叉树的层序遍历 -python

题目

给定一个 N 叉树，返回其节点值的层序遍历。 (即从左到右，逐层遍历)。
链接：https://leetcode.com/problems/n-ary-tree-level-order-traversal/

Given an n-ary tree, return the level order traversal of its nodes’ values.

Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).

Example:

Input: root = [1,null,3,2,4,null,5,6]
Output: [[1],[3,2,4],[5,6]]

思路及代码

1. BFS Iteratively

"""
# 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]]:
        queue = [root]
        ans = []
        if not root:
            return ans
        while queue:
            level = []
            level_child = []
            for node in queue:
                for child in node.children:
                    level_child.append(child)
                level.append(node.val)
            ans.append(level)
            queue = level_child
        return ans

2. DFS Recursion 递归

class Solution:
    def levelOrder(self, root: 'Node') -> List[List[int]]:
        def dfs(node, d):
            if not node:
                return
            if len(ans) <= d:
                ans.append([])
            ans[d].append(node.val)
            for child in node.children:
                dfs(child, d+1)
        
        ans = []
        dfs(root, 0)
        return ans

复杂度

T = $O(n)$
S = $O(n)$