[LeetCode] Binary Tree Postorder Traversal

最新推荐文章于 2022-07-19 11:52:33 发布

原创最新推荐文章于 2022-07-19 11:52:33 发布 · 860 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#二叉树后序遍历 #迭代算法 #栈

算法C++描述同时被 2 个专栏收录

33 篇文章

订阅专栏

LeetCode Excercise

16 篇文章

订阅专栏

本文介绍了一种不使用递归的方法来完成二叉树节点值的后序遍历。通过栈结构实现迭代过程，避免了递归带来的栈溢出风险，并详细展示了算法的具体实现。

Question:

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?

Solution (C++):

 /**
 * 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) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        
        vector<int> result;
        if (root == NULL) return result;
        stack<TreeNode*> com;
        com.push(root);
        TreeNode *temp = NULL;
        
        while(!com.empty())
        {
            temp = com.top();
            if(temp -> left == NULL && temp -> right == NULL)
            {
                result.push_back(temp -> val);
                com.pop();
            }
            else
            {
                if(temp -> right)
                {
                    com.push(temp -> right);
                    temp -> right = NULL;
                }
                if(temp -> left)
                {
                    com.push(temp -> left);
                    temp -> left = NULL;
                }

            }
        }
        return result;
        
    }
};