LeetCode:Binary Tree Postorder Traversal

最新推荐文章于 2023-09-23 19:34:38 发布

walker lee

最新推荐文章于 2023-09-23 19:34:38 发布

阅读量446

点赞数

分类专栏： LeetCode OJ LeetCode解题记录文章标签： LeetCode Binary Tree Postorder Traversal

本文链接：https://blog.csdn.net/itismelzp/article/details/50189081

版权

LeetCode OJ 同时被 2 个专栏收录

216 篇文章 0 订阅

订阅专栏

LeetCode解题记录

216 篇文章 13 订阅

订阅专栏

Binary Tree Postorder Traversal

Total Accepted: 81817 Total Submissions: 242139 Difficulty: Hard

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?

code:

/**
 * 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> ivec;
        if(NULL == root) return ivec;
        TreeNode *cur;
        TreeNode *pre=NULL;
        stack<TreeNode *> s;
        s.push(root);
        while(!s.empty()){
            cur=s.top();
            if((NULL==cur->left && NULL==cur->right) ||
            (pre!=NULL && (pre==cur->left || pre==cur->right))){
                ivec.push_back(cur->val);
                s.pop();
                pre=cur;
            }
            else{
                if(cur->right!=NULL) s.push(cur->right);
                if(cur->left!=NULL) s.push(cur->left);
            }
        }
        return ivec;
    }
};