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
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步