LeetCode 145. Binary Tree Postorder Traversal

描述

后序迭代遍历二叉树

解决

用stack存节点，当当前根结点的左右节点为空或者右子节点被访问过，就把根节点加入vector中

---

/**
* 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) {
        if (!root)
            return {};
        stack<TreeNode*> st;
        vector<int> res;
        TreeNode *zz = NULL;
        while (root || !st.empty())
        {
            while (root)
            {
                st.push(root);
                root = root -> left;
            }
            TreeNode *temp = st.top();
            if (temp -> right == NULL || temp -> right == zz)
            {
                res.push_back(temp -> val);
                zz = temp;
                st.pop();
            }
            else
            {
                root = temp -> right;
            }
        }
        return res;
    }
};