Pehle Istamaal Karo, Phir Vishwas karo.
Code\ncpp []\n/*\n// Definition for a Node.\nclass Node {\npublic:\n    int val;\n    vector<Node*> children;\n\n    Node() {}\n\n    Node(int _val) {\n        
# Code\n```cpp []\n/*\n// Definition for a Node.\nclass Node {\npublic:\n    int val;\n    vector<Node*> children;\n\n    Node() {}\n\n    Node(int _val) {\n        val = _val;\n    }\n\n    Node(int _val, vector<Node*> _children) {\n        val = _val;\n        children = _children;\n    }\n};\n*/\n\nclass Solution {\npublic:\n    void solve(Node* root, vector<int>& vec)\n    {\n        if(root)\n        {\n            int n = root->children.size();\n            for(int i = 0; i < n; i++)\n                solve(root->children[i], vec);\n            vec.push_back(root->val);    \n        }\n    }\n\n    vector<int> postorder(Node* root) {\n        vector<int> vec;\n        solve(root, vec);\n        return vec;\n    }\n};\n```
['Depth-First Search', 'C++']