[leetcode]Binary Tree Postorder Traversal @ Python
原題地址：http://oj.leetcode.com/problems/binary-tree-postorder-traversal/ 題意：實現后序遍歷。遞歸實現比較簡單，非遞歸實現。 解題思路：這道題的迭代求解比先序遍歷和后序遍歷要麻煩一些。假設一棵樹是這樣的： 1 / \ ...
原文：[LeetCode] Binary Tree Postorder Traversal
Given a binary tree, return thepostordertraversal of its nodes values. For example:Given binary tree , , , , return , , . Note:Recursive solution is trivial, could you do it iteratively 解題思路： 相比於前序遍歷 ...
2013-11-10 10:22 0 3113 推薦指數：
相關推薦
[leetcode]Construct Binary Tree from Inorder and Postorder Traversal @ Python
原題地址：http://oj.leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/ 題意：根據二叉樹的中序遍歷和后序遍歷恢復二叉樹。 解題思路：看到樹首先想到要用遞歸來解題。以這道題為 ...
[LeetCode] Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 遞歸構造 ...
[LeetCode] Construct Binary Tree from Inorder and Postorder Traversal 由中序和后序遍歷建立二叉樹
Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree ...
[LeetCode] 145. Binary Tree Postorder Traversal 二叉樹的后序遍歷
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 ...
LeetCode Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 非遞歸版本： 用一個棧來模擬遞歸的情況， 首先思考inorder ...
[LeetCode] 889. Construct Binary Tree from Preorder and Postorder Traversal 由先序和后序遍歷建立二叉樹
Return any binary tree that matches the given preorder and postorder traversals. Values in the traversals pre and post are distinct positive ...
[leetcode]Binary Tree Inorder Traversal @ Python
原題地址：http://oj.leetcode.com/problems/binary-tree-inorder-traversal/ 題意：二叉樹的中序遍歷。這道題用遞歸比較簡單，考察的是非遞歸實現二叉樹中序遍歷。中序遍歷順序為：左子樹，根，右子樹。如此遞歸下去。 解題思路：假設樹為： 1 / \ ...