590. N-ary Tree Postorder Traversal

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

清，纯一色

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

阅读量72

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/ordili/p/9974930.html

本文详细解析了LeetCode上590题N-ary树的后序遍历算法，通过定义Node类和Solution类，实现了一个递归方法来获取树节点的后序遍历序列。示例中给出了一个3-ary树的例子，并返回其后序遍历结果。

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

1. Quesiton

590. N-ary Tree Postorder Traversal

URL: https://leetcode.com/problems/n-ary-tree-postorder-traversal/description/

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

For example, given a 3-ary tree:

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

2. Solution

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


class Solution(object):

    def postorderHelp(self,root,path):
        if root is None:
            return
        children = root.children
        for ch in children:
            self.postorderHelp(ch,path)
        path.append(root.val)

    def postorder(self, root):
        """
        :type
        root: Node
        :rtype: List[int]
        """
        re_li = []
        self.postorderHelp(root,re_li)
        return re_li