LEETCODE: Binary Tree Postorder Traversal

最新推荐文章于 2024-10-01 23:05:47 发布

停止更新+1

最新推荐文章于 2024-10-01 23:05:47 发布

阅读量304

点赞数

文章标签：遍历算法 LEETCODE

本文链接：https://blog.csdn.net/anyicheng2015/article/details/42582721

版权

LEETCODE 专栏收录该内容

153 篇文章 0 订阅

订阅专栏

Given a binary tree, return the postorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

return [3,2,1].

Note: Recursive solution is trivial, could you do it iteratively?

/**
 * 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<pair<TreeNode*, int>> noderecords;
        stack<int> nodeStatus;
        
        if(root != NULL){
            noderecords.push(make_pair(root, 0));
        }
        
        while(!noderecords.empty()){
            TreeNode* n = noderecords.top().first;
            int status = noderecords.top().second;
            noderecords.pop();
            
            if(status == 0){
                noderecords.push(make_pair(n, 1));
                if(n->right != NULL){
                    noderecords.push(make_pair(n->right, 0));
                }
                if(n->left != NULL){
                    noderecords.push(make_pair(n->left, 0));
                }
            }
            else{
                result.push_back(n->val);
            }
        }
        
        return result;
    }
};