Postorder Traversal

（后序遍历）是二叉树遍历的一种方式，它的遍历顺序是先访问左子树，再访问右子树，最后访问根节点。在后序遍历中，根节点的访问时间是最晚的。

后序遍历的分类：

递归后序遍历：通过递归调用实现后序遍历，先递归遍历左子树，再递归遍历右子树，最后访问根节点。
迭代后序遍历：使用栈来模拟后序遍历的过程，先将根节点入栈，然后循环执行以下步骤：弹出栈顶节点，将其值存入结果列表，先将左子节点入栈，再将右子节点入栈。最后将结果列表反转，即可得到后序遍历的结果。

后序遍历的优势：

后序遍历可以保证先访问子节点，再访问父节点，适用于某些问题的解决方案。
后序遍历可以用于释放二叉树的内存，先释放子节点的内存，再释放父节点的内存。

后序遍历的应用场景：

表达式树求值：后序遍历可以用于对表达式树进行求值，先计算子节点的值，再根据父节点的操作符进行计算。
二叉搜索树的删除操作：后序遍历可以用于删除二叉搜索树中的节点，先删除子节点，再删除父节点。

腾讯云相关产品和产品介绍链接地址：

腾讯云云服务器（CVM）：提供弹性计算能力，满足各类业务需求。产品介绍链接
腾讯云云数据库 MySQL 版（TencentDB for MySQL）：提供稳定可靠的云数据库服务，支持高可用、备份恢复等功能。产品介绍链接
腾讯云人工智能（AI）：提供丰富的人工智能服务，包括图像识别、语音识别、自然语言处理等。产品介绍链接
腾讯云物联网（IoT）：提供全面的物联网解决方案，包括设备接入、数据管理、应用开发等。产品介绍链接
腾讯云移动开发（Mobile）：提供移动应用开发的云服务，包括移动推送、移动分析、移动测试等。产品介绍链接
腾讯云对象存储（COS）：提供安全可靠的云端存储服务，适用于各类数据存储需求。产品介绍链接
腾讯云区块链（Blockchain）：提供高性能、安全可信的区块链服务，支持多种场景的区块链应用开发。产品介绍链接

以上是关于后序遍历的完善且全面的答案，希望能对您有所帮助。

相关·内容

Binary Tree Postorder Traversal

TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: void PostOrder...=NULL) { PostOrder(root->left,vec); PostOrder(root->right,vec);...} } vector postorderTraversal(TreeNode *root) { vectorvec; PostOrder

5038 0

Binary Tree Postorder Traversal — LeetCode

原题链接: http://oj.leetcode.com/problems/binary-tree-postorder-traversal/ 跟 Binary Tree Inorder Traversal...和 Binary Tree Preorder Traversal ，后序遍历的情况就复杂多了。...我后来再看wiki的时候发现有跟Binary Tree Inorder Traversal和Binary Tree Preorder Traversal非常类似的解法，容易统一进行记忆，思路可以参考其他两种...不过同样相比于Binary Tree Inorder Traversal和Binary Tree Preorder Traversal，后序遍历的情况要复杂得多，因为后序遍历中一直要等到孩子结点访问完才能访问自己...如果对这个复杂度结果不是很熟悉的朋友，可以先看看 Binary Tree Inorder Traversal 中的分析，在那个帖子中讲得比较详细。

1981 0

33 N-ary Tree Postorder Traversal

题目 Given an n-ary tree, return the postorder traversal of its nodes’ values....Nary-Tree input serialization is represented in their level order traversal, each group of children is...再遍历根节点解答 class Solution { // 存放结果 List list = new ArrayList(); public List postorder...null) return list; // 递归遍历其他节点 for(Node node: root.children) postorder

2722 0

Leetcode 145 Binary Tree Postorder Traversal

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

3648 0

LeetCode 0145 - Binary Tree Postorder Traversal

Binary Tree Postorder Traversal Desicription Given a binary tree, return the postorder traversal of its...TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { private: void traversal...(TreeNode* cur, vector& vec) { if(cur == NULL) return ; traversal(cur...->left, vec); traversal(cur->right, vec); vec.push_back(cur->val); } public:...vector postorderTraversal(TreeNode* root) { vector vec; traversal(root, vec

2022 0

Binary Tree Postorder Traversal

Binary Tree Postorder Traversal Given a binary tree, return the?postorder?traversal of its nodes' values

3581 0

Leetcode145——Binary Tree Postorder Traversal

问题描述 Given a binary tree, return the postorder traversal of its nodes’ values.

2945 0

Construct Binary Tree from Inorder and Postorder Traversal

链接：https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description...Construct Binary Tree from Inorder and Postorder Traversal Given inorder and postorder traversal of a...Construct Binary Tree from Preorder and Inorder Traversal类似。..., 0, postorder.length-1, inorderMap); } public TreeNode buildTree(int[] inorder, int iLeft,..., i+1, iRight, postorder, pLeft+i-iLeft, pRight-1, inorderMap); return cur; } }

4792 0

PAT（甲级）1138.Postorder Traversal（25）

PAT 1138.Postorder Traversal（25） Suppose that all the keys in a binary tree are distinct positive integers...Given the preorder and inorder traversal sequences, you are supposed to output the first number of the...postorder traversal sequence of the corresponding binary tree....输出格式： For each test case, print in one line the first number of the postorder traversal sequence of...(node* root){ if(root){ postorder(root->lchild); postorder(root->rchild);

2073 0

LeetCode 590 N-ary Tree Postorder Traversal

val = _val; children = _children; } }; */ class Solution { public List postorder...} }; */ class Solution { List list = new ArrayList(); public List postorder...return list; } for (Node child : root.children) { postorder...Traversal....Memory Usage: 48.2 MB, less than 40.66% of Java online submissions for N-ary Tree Postorder Traversal

4481 0

【leetcode】Construct Binary Tree from Inorder and Postorder Traversal

Question：? Given inorder and postorder traversal of a tree, construct the binary tree....[postorder[post_offset]]; root->right = buildTreeInOrder(postorder, post_offset-1, inorder,...in_offset, in_offset-i); root->left = buildTreeInOrder(postorder, post_offset-(in_offset-i)-1..., postorder.size()-1, inorder, inorder.size()-1, postorder.size()); } }; 参考推荐： Construct Binary Tree...from Inorder and Postorder Traversal

3683 0

Leetcode: Construct Binary Tree from Inorder and Postorder Traversal

题目： Given inorder and postorder traversal of a tree, construct the binary tree....思路分析：这道题和上道题《 Leetcode: Construct Binary Tree from Preorder and Inorder Traversal 》的思路类似。...) { if (postorder.empty()) return nullptr; TreeNode *root = makeNode(inorder.begin...(), inorder.end(), postorder.begin(), postorder.end()); return root; } }; Java参考代码： /**..., postorder, 0, postorder.length); return root; } }

4042 0

N-ary Tree Postorder Traversal

val = _val; children = _children; } }; */ class Solution { public: vector postorder...val = _val; children = _children; } }; */ class Solution { public: vector postorder...reverse(result.begin(), result.end()); } }; Reference https://leetcode.com/problems/n-ary-tree-postorder-traversal

3002 0

Leetcode 106 Construct Binary Tree from Inorder and Postorder Traversal

Given inorder and postorder traversal of a tree, construct the binary tree....+1,ie); return root; } TreeNode* buildTree(vector& inorder, vector& postorder...) { return dfs(postorder,0,inorder.size()-1,inorder,0,inorder.size()-1); } };

5816 0

Leetcode Binary Tree Postorder Traversal(面试题推荐)

此题来自leetcode https://oj.leetcode.com/problems/binary-tree-postorder-traversal/ Given a binary tree..., return the postorder traversal of its nodes' values.

2421 0

LeetCode 0106 - Construct Binary Tree from Inorder and Postorder Traversal

Construct Binary Tree from Inorder and Postorder Traversal Desicription Given inorder and postorder traversal...private: TreeNode* generateTree(int postStart, int postEnd, int inStart, int inEnd, vector& postorder...int inIndex = 0; for(int i = inStart; i <= inEnd; i++) { if(inorder[i] == postorder..., inorder); root->right = generateTree(postEnd-inEnd+inIndex, postEnd-1, inIndex+1, inEnd, postorder...) { return generateTree(0, postorder.size()-1, 0, inorder.size()-1, postorder, inorder);

1423 0

Binary Tree Postorder Traversal.go

3473 0

Construct Binary Tree from Inorder and Postorder Traversal

NULL) {} * }; */ class Solution { public: TreeNode* buildTree(vector& inorder, vector& postorder...) { int current = inorder.size() - 1; return build(postorder, inorder, current, 0, postorder.size...() - 1); } private: TreeNode* build(vector& postorder, vector& inorder, int& current..., inorder, current, index + 1, end); node->left = build(postorder, inorder, current, start, index...return node; } }; Reference https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal

2921 0

Construct Binary Tree from Inorder and Postorder Traversal

Problem Given inorder and postorder traversal of a tree, construct the binary tree....For example, given inorder = [9,3,15,20,7] postorder = [9,15,7,20,3] Return the following binary tree...): if not len(postorder): return None root = TreeNode(postorder[-1])...idx = inorder.index(root.val) root.left = self.buildTree(inorder[ : idx], postorder[ : idx])...root.right = self.buildTree(inorder[idx+1 : ], postorder[idx : -1]) return root

3003 0

Construct Binary Tree from Inorder and Postorder Traversal「建议收藏」

Given inorder and postorder traversal of a tree, construct the binary tree....Traversal....Traversal. /** * Definition for a binary tree node...) { if (null == postorder || postorder.length < 1) { return null; }...return buildTree(inorder, 0, inorder.length - 1, postorder, postorder.length - 1); }

1411 0

点击加载更多

扫码

添加站长进交流群

领取专属 10元无门槛券

手把手带您无忧上云

Postorder Traversal

相关·内容

Binary Tree Postorder Traversal

Binary Tree Postorder Traversal — LeetCode

33 N-ary Tree Postorder Traversal

Leetcode 145 Binary Tree Postorder Traversal

LeetCode 0145 - Binary Tree Postorder Traversal

Binary Tree Postorder Traversal

Leetcode145——Binary Tree Postorder Traversal

Construct Binary Tree from Inorder and Postorder Traversal

PAT（甲级）1138.Postorder Traversal（25）

LeetCode 590 N-ary Tree Postorder Traversal

【leetcode】Construct Binary Tree from Inorder and Postorder Traversal

Leetcode: Construct Binary Tree from Inorder and Postorder Traversal

N-ary Tree Postorder Traversal

Leetcode 106 Construct Binary Tree from Inorder and Postorder Traversal

Leetcode Binary Tree Postorder Traversal(面试题推荐)

LeetCode 0106 - Construct Binary Tree from Inorder and Postorder Traversal

Binary Tree Postorder Traversal.go

Construct Binary Tree from Inorder and Postorder Traversal

Construct Binary Tree from Inorder and Postorder Traversal

Construct Binary Tree from Inorder and Postorder Traversal「建议收藏」

扫码

相关资讯

热门标签

活动推荐

运营活动

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐