class Solution {
public:
    vector<int> postorderTraversal(TreeNode *root) {
        vector<int> res;
        if(root == nullptr)
            return res;
        
        stack<TreeNode*> st;
        st.push(root);
        while(!st.empty())
        {
            TreeNode* cur = st.top();
            st.pop();
            if(cur!=nullptr){
                res.push_back(cur->val);
                st.push(cur->left);
                st.push(cur->right);
            }
        }
        
        reverse(res.begin(),res.end());
        return res;
    }
};