Python3 easiest solution 87% fast
Approach\n Describe your approach to solving the problem. \n- traverse left to right children sub tree.\n- then append root.\n- return ans\n\n# Complexity\n- Ti
# Approach\n<!-- Describe your approach to solving the problem. -->\n- traverse left to right children sub tree.\n- then append root.\n- return ans\n\n# Complexity\n- Time complexity: O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(N)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def postorder(self, root: \'Node\') -> List[int]:\n        ans = []\n        def postOrder(curr = root):\n            nonlocal ans\n            if curr:\n                for i in curr.children:\n                    postOrder(i)\n                ans.append(curr.val)\n        postOrder()\n        return ans\n```\n# Please like and comment below :-)
['Python3']