✔️ 👨‍💻 Simple C++ 5 lines Solution
Firstly go on the node call to their children  by recursion by coming back do  vec.push_back(root->val); \n\nclass Solution {\npublic:\n        vector<int> vec;
Firstly go on the node call to their children  by recursion by coming back do  `vec.push_back(root->val);` \n```\nclass Solution {\npublic:\n        vector<int> vec;\n    void posthelp(Node* root){\n        if(!root){\n            return;\n        }\n        \n        for(auto rot: root->children)\n        {\n            posthelp(rot);\n        }\n        vec.push_back(root->val);\n    }\n  \n    vector<int> postorder(Node* root) {      \n        posthelp(root);\n        return vec;\n    }\n};\n```\n##### If you like this solution, do **UPVOTE**.\n##### Feel free to ask any **doubts** in the comment section.\n##### Happy Coding :)
[]