C++ | Fast | Easy
A very simple recursive code for the postorder traversal.\n\n\n\nclass Solution {\n    vector<int> result;\npublic:\n    vector<int> postorder(Node* root) {\n  
A very simple recursive code for the postorder traversal.\n\n```\n\nclass Solution {\n    vector<int> result;\npublic:\n    vector<int> postorder(Node* root) {\n        if(root){\n            for(Node *i : root -> children){\n                postorder(i);    \n            }\n            result.push_back(root -> val);\n        }\n        return result;\n    }\n};\n\n```
['C', 'C++']