---
title: "590. N-ary Tree Postorder Traversal"
url: "https://laigary.com/interview/coding/590-n-ary-tree-postorder-traversal"
type: "note"
section: "coding"
date: "2023-01-29"
updated: "2023-11-06"
tags: ["Tree", "Postorder Traversal"]
---

# 590. N-ary Tree Postorder Traversal

[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=None, children=None):
        self.val = val
        self.children = children
"""

class Solution:
    def postorder(self, root: 'Node') -> List[int]:
        if not root:
            return []
        res = []
        for child in root.children:
            res.extend(self.postorder(child))
        res.append(root.val)
        return res

```