simple and easy C++ 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```cpp []\nclass Solution {\npublic:\n\n    vector<int>a;\n\n    void postOrder(Node* root)\n    {\n        if(root == NULL) return;\n        for(Node* child: root->children)\n            postOrder(child);\n        a.push_back(root->val);\n    }\n    vector<int> postorder(Node* root) \n    {\n        postOrder(root);\n        return a;\n    }\n};\n```
['Stack', 'Tree', 'Depth-First Search', 'C++']