Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
For example:
Given binary tree {3,9,20,#,#,15,7},
...
分类：
其他好文 时间：
2014-07-14 17:31:14
阅读次数：
229
[LeetCode]Binary Tree Inorder Traversal...
分类：
其他好文 时间：
2014-07-14 16:10:00
阅读次数：
193
Implement a function to check if a binary tree is a binary search tree./* The inorder travel of a BST is strictly increasing. We track the pre node of...
分类：
其他好文 时间：
2014-07-13 22:27:09
阅读次数：
344
BACKGROUNDMany algorithms on a graphics processing unit (GPU) may benefit from doing a query in a hierarchical tree structure (including quad-trees, o...
分类：
其他好文 时间：
2014-07-13 19:47:28
阅读次数：
289
Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1
2
/
3
return [1,2,3].
/**
* Definition for bi...
分类：
其他好文 时间：
2014-07-13 18:46:25
阅读次数：
249
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 solut...
分类：
其他好文 时间：
2014-07-13 17:18:19
阅读次数：
193
Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2...
分类：
编程语言 时间：
2014-07-12 13:13:24
阅读次数：
195
题目：Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.说明： 1）二叉树可.....
分类：
其他好文 时间：
2014-07-11 21:07:27
阅读次数：
273
题目：Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.说明： 1）实现与.....
分类：
其他好文 时间：
2014-07-11 20:40:38
阅读次数：
198
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.思路：递归。主要是注意调用时起...
分类：
其他好文 时间：
2014-07-10 14:40:07
阅读次数：
196
