＜leetcode＞145.二叉树的后序遍历——递归、迭代

给你一棵二叉树的根节点 root ，返回其节点值的 后序遍历 。
解答：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    void helper(const TreeNode* root, vector<int>& res){
        if(root == nullptr) return;
        helper(root->left, res);
        helper(root->right, res);
        res.emplace_back(root->val);
    }

    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> res;
        helper(root, res);
        return res;
    }
};

解答：迭代

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> res;
        stack<TreeNode*> st;
        TreeNode* prev = nullptr;
        while(!st.empty() || root != nullptr){
            while(root != nullptr){
                st.emplace(root);
                root = root->left;
            }
            root = st.top();
            st.pop();
            //prev指针记录是否已经遍历过右子树
            if(root->right == nullptr || root->right == prev){
                res.emplace_back(root->val);
                prev = root;
                root = nullptr;
            }else{
                st.emplace(root);
                root = root->right;
            } 
        }
        return res;
    }
};