题目：Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree....
分类：
编程语言 时间：
2014-08-05 05:18:28
阅读次数：
242
题目：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).F....
分类：
编程语言 时间：
2014-08-05 05:18:08
阅读次数：
340
题目：Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level ....
分类：
编程语言 时间：
2014-08-05 05:17:38
阅读次数：
311
题目：Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space....
分类：
编程语言 时间：
2014-08-05 05:17:28
阅读次数：
265
An example of in-order traversal application. My intuition is that, we have to serialize it into an array and check, but in-order traversal does exact...
分类：
其他好文 时间：
2014-08-05 03:03:48
阅读次数：
241
Follow up for problem "Populating Next Right Pointers in Each Node".
What if the given tree could be any binary tree? Would your previous solution still work?
Note:
You may only use constant ...
分类：
其他好文 时间：
2014-08-05 00:51:38
阅读次数：
249
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ...
分类：
其他好文 时间：
2014-08-05 00:37:38
阅读次数：
233
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and ...
分类：
其他好文 时间：
2014-08-05 00:18:28
阅读次数：
225
Given preorder and inorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree./** * Definiti...
分类：
其他好文 时间：
2014-08-05 00:01:38
阅读次数：
271
Given inorder and postorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.class Solutio...
分类：
其他好文 时间：
2014-08-04 23:57:18
阅读次数：
476
