Easy solution || recursion
\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 {\n    vector<int>ans;\npublic:\n    vector<int> postorder(Node* root) {\n         if(!root){\n            vector<int>v;\n            return v;\n        }\n       \n        for(auto n:root->children){\n            postorder(n);\n        }\n         ans.push_back(root->val);\n        return ans;\n    }\n};\n```
['Tree', 'Recursion', 'C++']