LeetCode145—Binary Tree Postorder Traversal

原题

原题链接

Given a binary tree, return the postorder traversal of its nodes’ values.

For example:
Given binary tree {1,#,2,3},
1
\
2
/
3
return [3,2,1].

Note: Recursive solution is trivial, could you do it iteratively?

分析

后序遍历的迭代写法，参见：二叉树遍历

//递归算法略
class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int>res;
        if(!root)
        {
            return res;
        }
        TreeNode *cur;
        TreeNode *pre=NULL;
        stack<TreeNode*>s;
        s.push(root);
        while(!s.empty())
        {
            cur=s.top();
            if( (cur->left==NULL&&cur->right==NULL) 
            || (pre!=NULL&& (pre==cur->left||pre==cur->right) ) )
            {
                res.push_back(cur->val);
                s.pop();
                pre=cur;
            }
            else
            {
                if(cur->right!=NULL)
                {
                    s.push(cur->right);
                }
                if(cur->left!=NULL)
                {
                    s.push(cur->left);
                }
            }
        }
        return res;
    }
};