590. N-ary Tree Postorder Traversal
Posted ordili
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了590. N-ary Tree Postorder Traversal相关的知识,希望对你有一定的参考价值。
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
以上是关于590. N-ary Tree Postorder Traversal的主要内容,如果未能解决你的问题,请参考以下文章
Leetcode590. N-ary Tree Postorder Traversal
Leetcode 590. N-ary Tree Postorder Traversal
(N叉树 递归) leetcode 590. N-ary Tree Postorder Traversal
[LeetCode] 590. N-ary Tree Postorder Traversal_Easy
[LeetCode&Python] Problem 590. N-ary Tree Postorder Traversal