"""
# Definition for a Node.
class Node:
def __init__(self, val=None, children=None):
self.val = val
self.children = children
"""
class Solution:
def postorder(self, root: 'Node') -> List[int]:
result = []
def traversal(root: 'Node'):
if root == None:
return
for ch in root.children:
traversal(ch)
result.append(root.val)
traversal(root)
return result
思路:
注意需要依次遍历所有孩子节点,孩子位置