Binary Tree Postorder Traversal

Description:

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?

思路：

以下实现中既有递归实现也有非递归实现。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> postorderTraversal(TreeNode *root) {
        vector<int> res;
        solve2(root,res);
        return res;
    }
private:
    void solve(TreeNode *root,vector<int>& res)
    {
        if(root == NULL)return;
        if(root->left)solve(root->left,res);
        if(root->right)solve(root->right,res);
        res.push_back(root->val);
        return;
    }
    void solve2(TreeNode *root,vector<int>& res)
    {
        if(root == NULL)return;
        stack<pair<TreeNode*,pair<int,int> > > s;
        s.push(make_pair(root,make_pair(1,1)));
        while(!s.empty())
        {
            pair<TreeNode*,pair<int,int> >& p1=s.top();
            root=p1.first;
            if(p1.second.first==0 && p1.second.second==0)
            {
                res.push_back(root->val);
                s.pop();
                continue;
            }
    
            if(p1.second.first)
            {
                p1.second.first=0;
                while(root->left)
                {
                    s.push(make_pair(root->left,make_pair(0,1)));
                    root=root->left;
                }
            }
            
            pair<TreeNode*,pair<int,int> >& p2=s.top();
            root=p2.first;
            if(p2.second.second)
            {
                p2.second.second=0;
                if(root->right)s.push(make_pair(root->right,make_pair(1,1)));
                else
                {
                    res.push_back(root->val);
                    s.pop();
                }
            }
        }
        return;
    }
};