N-ary Tree Postorder Traversal — LeetCode 590 Python Solution

The problem

Given the root of an n-ary tree, return the postorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level order traversal.

Example

Input

root = [1,null,3,2,4,null,5,6]

Output

[5,6,3,2,4,1]

Python solution

"""
# 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]:
        def dfs(root):
            if root is None:
                return
            for child in root.children:
                dfs(child)
            ans.append(root.val)

        ans = []
        dfs(root)
        return ans

Complexity

Pattern: Stack

When the most recent unresolved thing is the one that matters, use a stack. LeetCode 590. N-ary Tree Postorder Traversal is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Stack.

The stack guide has the Python template for the pattern and the 194 LeetCode problems that use it.

Related problems