589. N-ary Tree Preorder Traversal -python

最新推荐文章于 2022-04-20 03:28:39 发布

原创最新推荐文章于 2022-04-20 03:28:39 发布 · 335 阅读

1 ·

CC 4.0 BY-SA版权

本文介绍了一个解决LeetCode上N-ary树前序遍历问题的Python实现方案，通过递归的方式获取树节点的值并返回前序遍历结果。运行效率高于100%的在线提交。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

leetcode：589. N-ary Tree Preorder Traversal -python

Given an n-ary tree, return the preorder traversal of its nodes' values.

For example, given a 3-ary tree:

Return its preorder traversal as: [1,3,5,6,2,4]

`题目的意思为：前序遍历树。`

Runtime: 132 ms, faster than 100.00% of Python3 online submissions for N-ary Tree Preorder Traversal.

"""
# Definition for a Node.
class Node:
    def __init__(self, val, children):
        self.val = val
        self.children = children
"""
class Solution:
    def preorder(self, root):
        """
        :type root: Node
        :rtype: List[int]
        """
        if root==None:
            return []
        output = []
        self.get_out(output,root)
        return output
    def get_out(self,output, root):
        if root:
            output.append(root.val)
        if root.children!=None:
            for node_child in root.children:
                self.get_out(output, node_child)
        return output