【N叉树】【DFS】N叉树的前序遍历

题目：

解答：
方法一：递归

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

class Solution:
    def traverval(self,node,res):
        if not node:
            return 
        res.append(node.val)
        for child in node.children:
            self.traverval(child,res)

    def preorder(self, root: 'Node') -> List[int]:
        res=[]
        self.traverval(root,res)
        return res
        

方法二：迭代

"""
# 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]:
        if not root:
            return []
        stack=[root]
        res=[]
        while stack:
            cur=stack.pop()
            res.append(cur.val)
            stack.extend(cur.children[::-1])
        return res