Binary Tree Level Order Traversal IIGiven a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level...
分类：
其他好文 时间：
2014-08-08 23:53:16
阅读次数：
221
Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].Not...
分类：
其他好文 时间：
2014-08-07 00:15:17
阅读次数：
187
问题：输出二叉树的每一行的结点，从叶子到根/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(i...
分类：
其他好文 时间：
2014-08-06 22:04:02
阅读次数：
185
问题：从上到下打印二叉树的每一行分析：先搜出二叉树的高度，然后遍历高度，每次搜索一个高度class Solution {public: int dfs(TreeNode *root) { if(root==NULL) return 0; if(root->le...
分类：
其他好文 时间：
2014-08-06 21:53:32
阅读次数：
278
题目：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
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
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
