leetcode---N叉树的前序遍历

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

        return ans