leetcode 589. N叉树的前序遍历

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

class Solution:
    def __init__(self):
        self.res = list() # 初始化返回数组

    def preorder(self, root: 'Node') -> List[int]:
        if not root: # 基线条件
            return self.res
        self.res.append(root.val) # 存储结点值
        for node in root.children: # 遍历子结点
            self.preorder(node) # 递归子结点
        return self.res