---
title: "LeetCode #590: N-ary Tree Postorder Traversal"
url: https://perrotta.dev/2026/01/leetcode-%23590-n-ary-tree-postorder-traversal/
last_updated: 2026-01-03
---


[LeetCode #590: N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal):

```python
"""
# Definition for a Node.
class Node:
    def __init__(self, val: Optional[int] = None, children: Optional[List['Node']] = None):
        self.val = val
        self.children = children
"""

class Solution:
    def postorder(self, root: 'Node') -> List[int]:
        ans = []

        def dfs(node):
            if not node:
                return

            for child in node.children:
                dfs(child)

            ans.append(node.val)

        dfs(root)

        return ans
```