原题地址：http: oj.leetcode.com problems binary tree level order traversal 题意：二叉树的层序遍历的实现。 解题思路：二叉树的层序遍历可以用bfs或者dfs来实现。这里使用的dfs实现，代码比较简洁。实际上，二叉树的先序遍历就是dfs实现。 比如一棵树如下： 二叉树的先序遍历为 ， ， ， ， ， ， ，可以看到这个遍历顺序实际上就是 ...
2014-05-11 17:55 0 4584 推荐指数：
原题地址：http://oj.leetcode.com/problems/binary-tree-level-order-traversal-ii/ 题意： Given a binary tree, return the bottom-up level order traversal ...
题目： Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given ...
原题地址：http://oj.leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ 题意： Given a binary tree, return the zigzag level order traversal ...
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 ...
LeetCode:Binary Tree Level Order Traversal Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right ...
Binary Tree Level Order Traversal II Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right ...
题目： 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 ...
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 ...
