simple and easy Python solution 😍❤️‍🔥
\n# if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n###### Let\'s Connect on LinkedIn: www.linkedin.com/in/shishirrsiam\n###### Let\'s Connect on Facebook
\n# if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n###### Let\'s Connect on LinkedIn: www.linkedin.com/in/shishirrsiam\n###### Let\'s Connect on Facebook: www.fb.com/shishirrsiam\n\n\n\n\n\n# Code\n```python []\nclass Solution(object):\n    def PostOrder(self, root, ans):\n        if root:\n            for node in root.children:\n                self.PostOrder(node, ans)\n            ans.append(root.val)\n    def postorder(self, root):\n        ans = []\n        self.PostOrder(root, ans)\n        return ans\n```
['Stack', 'Tree', 'Depth-First Search', 'Python', 'Python3']