[LeetCode] 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?

思路： 用r表示最近访问过的节点。

　　　时间复杂度O(n)， 空间复杂度O(n)

/**
 * 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> result;
        stack<TreeNode *> s;
        TreeNode *p = root, *r = NULL;
        
        while (p != NULL || !s.empty()) {
            if (p!= NULL) {
                s.push(p);
                p = p->left;
            } else {
                p = s.top();
                if (p->right != NULL && p->right != r) {
                    p = p->right;
                } else {
                    result.push_back(p->val);
                    s.pop();
                    r = p;
                    p = NULL;
                }
            }
        }
        
        return result;
    }
};