145. Binary Tree Postorder Traversal

boligongzhu

于 2022-07-19 11:52:33 发布

阅读量237

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： c++ leetcode 算法数据结构

本文链接：https://blog.csdn.net/qing2019/article/details/125869106

leetcode 专栏收录该内容

83 篇文章

订阅专栏

这篇博客介绍了如何使用栈迭代法和递归法实现二叉树的后序遍历。通过示例代码详细展示了两种方法的具体步骤，并给出了对应的输出结果。后序遍历的顺序为左子树-右子树-根节点，这两种方法都能有效地完成遍历任务。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Example 1:

Input: root = [1,null,2,3]
Output: [3,2,1]

Example 2:

Input: root = []
Output: []

Example 3:

Input: root = [1]
Output: [1]

Constraints:

The number of the nodes in the tree is in the range [0, 100].
-100 <= Node.val <= 100

方法一：stack迭代法

/**
 * 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) {
        stack<TreeNode*> stk;
        vector<int> res;
        TreeNode* node = root;
        while(!stk.empty() || node){
            while(node){
                res.push_back(node->val);
                stk.push(node);
                node = node->right;
            }
            node = stk.top();
            stk.pop();
            node = node->left;
        }
        reverse(res.begin(), res.end());
        return res;
    }
};

方法二，递归法

/**
 * 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 getPost(TreeNode* node, vector<int>& res){
        if(!node) return;
        getPost(node->left, res);
        getPost(node->right, res);
        res.push_back(node->val);
        return;
    }
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> res;
        getPost(root, res);
        return res;
    }
};