Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the cor...
分类：
其他好文 时间：
2015-03-02 13:16:06
阅读次数：
112
Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to ou...
分类：
其他好文 时间：
2015-02-25 18:21:38
阅读次数：
143
Binary Tree dfs Traversal-preorder/inorder/postorder-divide&conquer-introduce dfs templatePreorder :Inorder；Postorder：Divide & Conquer :-Merge Sort (a...
分类：
其他好文 时间：
2015-02-25 11:38:00
阅读次数：
123
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: Recursive solution is trivial, could you do it iteratively?...
分类：
其他好文 时间：
2015-02-24 07:02:03
阅读次数：
180
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.这道题要求从中序和后序遍历的...
分类：
其他好文 时间：
2015-02-19 18:37:40
阅读次数：
221
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.[Solution]后序定根...
分类：
其他好文 时间：
2015-02-18 11:50:07
阅读次数：
129
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
这道题与上一题类似， 要求根据二叉树的后序遍历序列和中序遍历序列构建二叉树。后序遍历序列的末尾是根节点，在中...
分类：
其他好文 时间：
2015-02-14 13:47:49
阅读次数：
216
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].
解题思路:后序遍历的过程是首先左-右-父，首先...
分类：
其他好文 时间：
2015-02-06 13:15:22
阅读次数：
109
题目链接：https://oj.leetcode.com/problems/binary-tree-postorder-traversal/
题目：
Given a binary tree, return the postorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
...
分类：
其他好文 时间：
2015-02-02 23:22:05
阅读次数：
312
Q：Given a binary tree, return the postorder traversal
of its nodes' values.
Note：Recursive
solution is trivial, could you do it iteratively?
题目的意思就是不用递归求二叉树的后序遍历。
后续遍历的递归方式很简单，首先遍历左子树，然后遍历右子树，最...
分类：
其他好文 时间：
2015-01-31 14:49:58
阅读次数：
156
