原题地址：http: oj.leetcode.com problems binary tree zigzag level order traversal 题意： Given a binary tree, return thezigzag level ordertraversal of its nodes values. ie, from left to right, then right to l ...
2014-05-11 18:05 0 2283 推荐指数：
题目： 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 ...
原题地址：http://oj.leetcode.com/problems/binary-tree-level-order-traversal/ 题意：二叉树的层序遍历的实现。 解题思路：二叉树的层序遍历可以用bfs或者dfs来实现。这里使用的dfs实现，代码比较简洁。实际上，二叉树的先序遍历 ...
原题地址：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 ...
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 ...
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 ...
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 ...
LeetCode:Binary Tree Level Order Traversal Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right ...
