c++ solution || easy to understand
```\nvoid traversal(Node root,vector& vec)\n    {\n        if(!root)\n            return;\n        for(Node i:root->children)\n        {\n            traversal(
```\nvoid traversal(Node* root,vector<int>& vec)\n    {\n        if(!root)\n            return;\n        for(Node* i:root->children)\n        {\n            traversal(i,vec);\n        }\n        vec.push_back(root->val);\n    }\n    vector<int> postorder(Node* root) \n    {\n      vector<int> vec;\n      traversal(root,vec);\n        return vec;\n     \n    }\n};\nNOTE: IF THIS SOLUTION WAS HELPFUL THEN DO NOT FORGET TO UPVOTE :)
['C']