C++| EASY TO UNDERSTAND | 96.24% faster |RECURSIVE approach
Please upvote to motivate me in my quest of documenting all leetcode solutions. HAPPY CODING:)\nclass Solution {\npublic:\n    vector postorder(Node root) \n   
**Please upvote to motivate me in my quest of documenting all leetcode solutions. HAPPY CODING:)**\nclass Solution {\npublic:\n    vector<int> postorder(Node* root) \n    {\n       vector<int> ans;\n       visit(root,ans);\n       return ans;   \n    }\n    void visit(Node* root,vector<int> &ans)\n    {\n        if(root==NULL)\n            return;\n        else\n        {\n        for(int i=0;i<root->children.size();i++)\n        {\n            visit(root->children[i],ans);\n        }\n            ans.push_back(root->val);\n        }\n    }\n};
['Recursion', 'C']