n叉数的前序遍历class Solution: def preorder(self, root: Node) - List[int]: order[] if root!None: order.append(root.val) for i in range(len(root.children)): noderoot.children[i] orderself.preorder(node) return order类中的函数递归调用要使用self.preorder()调用