LeetCode | 145. Binary Tree Postorder Traversal

最新推荐文章于 2026-06-20 18:32:07 发布

原创最新推荐文章于 2026-06-20 18:32:07 发布 · 2.5k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#算法 #leetcode #二叉树

LeetCode 专栏收录该内容

285 篇文章

订阅专栏

本文介绍如何在给定二叉树的根节点的情况下，使用递归和迭代方法实现后序遍历，并提供了五个示例来展示操作过程。关注后序遍历的算法和代码实现，适合深入理解二叉树遍历技巧。

题目：

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]

Example 4:

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

Example 5:

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

Constraints:

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

Follow up:

Recursive solution is trivial, could you do it iteratively?

代码：

/**
 * 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:
    void backPostorder(TreeNode* root, vector<int>& res) {
		if(root == NULL)
			return;
		backPostorder(root->left, res);
		backPostorder(root->right, res);
		res.push_back(root->val);
		return;
	}
	vector<int> postorderTraversal(TreeNode* root) {
        vector<int> res;
		if(root == NULL)
			return res;
		backPostorder(root, res);
		return res;
    }
};