利用栈,注意入栈顺序是先right再left
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->right); st.push(cur->left); } } return res; } };