二叉树的非递归后续遍历

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/

void post_dfs(TreeNode* pRoot){
    stack<TreeNode*> s1;
    stack<TreeNode*> s2;
    s1.push(pRoot);
    while(!s1.empty()){
        TreeNode* p = s1.top();
        s1.pop();
        s2.push(p);
        if(p->left) s1.push(p->left);
        if(p->right) s1.push(p->right);
    }
    while(!s2.empty()){
        TreeNode* p = s2.top(); s2.pop();
        std::cout<<p->val;
    }
    std::cout<<std::endl;

}