|| Self Explanatory Code || Simple Postorder Traversal ||
\n\n# Code\n\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        
\n\n# Code\n```\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//Please Upvote if you like the approach!!\nvector<int>ans;\n  void solve(Node*root){\n      if(root==NULL){\n          return;\n      }\n    for(int i=0;i<root->children.size();i++){\n        solve(root->children[i]);\n    }\n\n      ans.push_back(root->val);\n  }\n    vector<int> postorder(Node* root) {\n        solve(root);\n        return  ans;\n    }\n};\n```
['Binary Tree', 'C++']