145.二叉树的后序遍历(迭代法）

https://leetcode-cn.com/problems/binary-tree-postorder-traversal/
在前序遍历的基础上改进

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        stack<TreeNode*>st;
        vector<int>result;
        st.push(root);
        while(!st.empty())
        {
            TreeNode*node=st.top();
            st.pop();
            if(node!=nullptr)result.push_back(node->val);
            else continue;
            st.push(node->left);//左右顺序交换
            st.push(node->right);
        }
        reverse(result.begin(),result.end());//反转输出
        return result;
    }
};