binary-tree-postorder-traversal（后序遍历二叉树）
2016-09-25 12:08
393 查看
题目描述
Given a binary tree, return the postorder traversal of its nodes' values.For example:
Given binary tree{1,#,2,3},
1 \ 2 / 3
return[3,2,1].
Note: Recursive solution is trivial, could you do it iteratively?
非递归实现：
语言：C++ 运行时间： <1 ms 占用内存：8568K 状态：答案正确
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- binary-tree-postorder-traversal——二叉树后续遍历
- 【遍历二叉树】03二叉树的后序遍历【Binary Tree Postorder Traversal】
- Binary Tree Postorder Traversal 二叉树的后序遍历，使用堆栈，非递归
- LeetCode-106：Construct Binary Tree from Inorder and Postorder Traversal (利用中序和后序遍历构建二叉树) -- medium
- Construct Binary Tree from Inorder and Postorder Traversal ——通过中序、后序遍历得到二叉树
- Leetcode - Tree - 106. Construct Binary Tree from Inorder and Postorder Traversal（根据中序遍历和后序遍历重构二叉树）
- lintcode 容易题：Binary Tree Postorder Traversal 二叉树的后序遍历
- Construct Binary Tree from Inorder and Postorder Traversal 中序和后序遍历二叉树
- 二叉树前/中/后序遍历非递归实现（用栈实现）LeetCode Binary Tree Traversal
- LeetCode OJ：Construct Binary Tree from Inorder and Postorder Traversal（从中序以及后序遍历结果中构造二叉树）
- LeetCode(Construct Binary Tree from Preorder and Inorder Traversal )根据二叉树的中序遍历和后序遍历重建二叉树
- 【LeetCode笔记】Construct Binary Tree from Inorder and Postorder Traversal 中序、后序遍历求二叉树
- LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal （用中序和后序树遍历来建立二叉树）
- 二叉树的后序遍历 Binary Tree Postorder Traversal
- LeetCode Binary Tree Postorder Traversal(二叉树的后序遍历 非递归实现)
- Leetcode Construct Binary Tree from Inorder and Postorder Traversal 中序后序遍历重组二叉树
- [LeetCode] Construct Binary Tree from Inorder and Postorder Traversal 由中序和后序遍历建立二叉树
- LeetCode 145: Binary Tree Postorder Traversal(二叉树的后序遍历，迭代法)
- LeetCode 145 Binary Tree Postorder Traversal (后序遍历二叉树)
- [LeetCode] 106. Construct Binary Tree from Inorder and Postorder Traversal 由中序和后序遍历建立二叉树