589. N-ary Tree Preorder Traversal

https://leetcode.com/problems/n-ary-tree-preorder-travers

class Solution(object):
    def preorder(self, root):
        """
        :type root: Node
        :rtype: List[int]
        """
        res = []
        if root == None: return res
        
        def recur(root,res): 
            res.append(root.val)
            for child in root.children:                
                recur(child,res)
                
        recur(root,res)
        return res

al/