Leetcode-589. N-ary Tree Preorder Traversal N叉树的前序遍历 -python

题目

给定一个 N 叉树，返回其节点值的前序遍历。
链接：https://leetcode.com/problems/n-ary-tree-preorder-traversal/

Given an n-ary tree, return the preorder 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,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
Output: [1,2,3,6,7,11,14,4,8,12,5,9,13,10]

思路及代码

1. DFS

"""
# Definition for a Node.
class Node:
    def __init__(self, val=None, children=None):
        self.val = val
        self.children = children
"""

class Solution:
    def preorder(self, root: 'Node') -> List[int]:
        def dfs(node):
            if not node:
                return
            ans.append(node.val)
            for child in node.children:
                dfs(child)
        
        ans = []
        dfs(root)
        return ans

2. Iteratively

class Solution:
    def preorder(self, root: 'Node') -> List[int]:
        ans = []
        if not root:
            return ans
        stack = [root]
        while stack:
            cur = stack.pop()
            ans.append(cur.val)
            for child in cur.children[::-1]:
                stack.append(child)
        return ans

复杂度

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