# Easy-题目33：102. Binary Tree Level Order Traversal

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

public class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {

List<List<Integer>> result=new ArrayList();
List<Integer> temp=new ArrayList<Integer>();
if(root==null)
return result;
while(!queue.isEmpty()) {
TreeNode current=queue.remove();
int curLevel=levelqueue.remove();
if(curLevel==result.size())
else {
temp=new ArrayList<Integer>();
}
if(current.left!=null) {
}
if(current.right!=null) {
}
}
result.remove(0);
return result;
}
}

3ms,beats 14.37%,众数3ms,46.37%

#### 【LeetCode】102. Binary Tree Level Order Traversal 解题报告

2016-05-26 15:06:54

#### LeetCode102 Binary Tree Level Order Traversal Java

2016-04-23 14:20:55

#### 102. Binary Tree Level Order Traversal [easy] (Python)

2016-05-10 14:40:58

#### LeetCode(102)Binary Tree Level Order Traversal

2014-01-15 06:44:39

#### leetcode 102 Binary Tree Level Order Traversal

2015-07-14 22:53:54

#### 【LeetCode with Python】 Binary Tree Level Order Traversal

2014-07-06 14:12:36

#### [C++]LeetCode: 31 Binary Tree Level Order Traversal

2014-11-25 19:17:18

#### LeetCode102 Binary Tree Level Order Traversal Java题解

2015-07-06 21:13:28

#### Leetcode_102_Binary Tree Level Order Traversal

2014-12-14 21:29:33

#### [LeetCode] Binary Tree Level Order Traversal 二叉树层次遍历(DFS | BFS)

2015-09-11 02:20:37