Recursive Python with generator
python\ndef postorder(self, root: \'Node\') -> List[int]:\n    def dfs(node):\n        if node:\n            for child in node.children:\n                yield 
```python\ndef postorder(self, root: \'Node\') -> List[int]:\n    def dfs(node):\n        if node:\n            for child in node.children:\n                yield from dfs(child)\n            yield node.val\n\n    return list(dfs(root))\n```
['Recursion', 'Python']