Leetcode 145二叉树后序遍历

Leetcode 145二叉树后序遍历

/**
 * 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:
    vector<int> postorderTraversal(TreeNode *root) {
        vector<int> res;
        if (root == nullptr) {
            return res;
        }

        stack<TreeNode *> stk;
        TreeNode *prev = nullptr;
        // root为空意味着此节点的左右子节点都遍历过了，跳过L24的while
        while (root != nullptr || !stk.empty()) {
            while (root != nullptr) {
                stk.emplace(root);
                root = root->left;
            }
            root = stk.top();
            stk.pop();
            // 如果当前节点右子节点为空或者右子节点已经便利过，则可以将当前节点输出，root置为当前节点
            if (root->right == nullptr || root->right == prev) {
                res.emplace_back(root->val);
                prev = root;
                root = nullptr;
            } else {//如果当前节点的右子节点不为空，还需要重新入栈，因为便利完其右子树后还会便利该节点
                stk.emplace(root);
                root = root->right;
            }
        }
        return res;
    }
};