LeetCode 解題報告
阿新 • • 發佈:2019-02-01
end self ldr .post n) python代碼 思路 solution for
題目要求
Given an n-ary tree, return the postorder traversal of its nodes‘ values.
題目分析及思路
題目給出一棵N叉樹,要求返回結點值的後序遍歷。可以使用遞歸的方法做。因為是後序遍歷,所以最後加入根結點的值。
python代碼?
"""
# Definition for a Node.
class Node:
def __init__(self, val, children):
self.val = val
self.children = children
"""
class Solution:
def postorder(self, root):
"""
:type root: Node
:rtype: List[int]
"""
order = []
if not root:
return order
for child in root.children:
order.extend(self.postorder(child))
order.append(root.val)
return order
LeetCode 解題報告