[LeetCode]145. Binary Tree Postorder Traversal--二叉树的后序遍历

145. 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?

---

分析：

// 递归
/**
 * Definition for a binary tree node.
 * 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;
        post(root, result);
        return result;
    }
    void post(TreeNode* root, vector<int>& result){
        if(root == NULL)
            return;
        post(root->left, result);
        post(root->right, result);
        result.push_back(root->val);
    }
};

// 迭代
/**
 * Definition for a binary tree node.
 * 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;
        if(!root)
            return result;
        stack<TreeNode*> s;
        // pCur:当前访问节点，pLastVisit:上次访问节点
        TreeNode* pCur = root;
        TreeNode* pLastVisit = NULL;
        // 走到最左端
        while(pCur){
            s.push(pCur);
            pCur = pCur->left;
        }
        while(!s.empty()){
            pCur = s.top();
            s.pop();
            // 一个根节点被访问的前提是：无右子树或右子树已被访问过 
            if(pCur->right == NULL || pCur->right == pLastVisit){
                result.push_back(pCur->val);
                pLastVisit = pCur;
            }else{
                // 根节点再次入栈
                s.push(pCur);
                //进入右子树，且可肯定右子树一定不为空
                pCur = pCur->right;
                while(pCur){
                    s.push(pCur);
                    pCur = pCur->left;
                }
            }
        }
        return result;
    }
};

// 线索二叉树
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void reverseNodes(TreeNode* start, TreeNode* end) {
        if (start == end) return;
        TreeNode* x = start;
        TreeNode* y = start -> right;
        TreeNode* z;
        while (x != end) {
            z = y -> right;
            y -> right = x;
            x = y;
            y = z;
        }
    }

    void reverseAddNodes(TreeNode* start, TreeNode* end, vector<int>& nodes) {
        reverseNodes(start, end);
        TreeNode* node = end;
        while (true) {
            nodes.push_back(node -> val);
            if (node == start) break;
                node = node -> right;
        }
        reverseNodes(end, start);
    }

    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> nodes;
        TreeNode* dump = new TreeNode(0);
        dump -> left = root;
        TreeNode* curNode = dump;
        while (curNode) {
            if (curNode -> left) {
                TreeNode* predecessor = curNode -> left;
                while (predecessor -> right && predecessor -> right != curNode)
                    predecessor = predecessor -> right;
                if (!(predecessor -> right)) {
                    predecessor -> right = curNode;
                    curNode = curNode -> left;
                }else {
                    reverseAddNodes(curNode -> left, predecessor, nodes);
                    predecessor -> right = NULL;
                    curNode = curNode -> right;
                }
            }else curNode = curNode -> right;
        }
        return nodes;
    }
};