###### Easy-题目27：107.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, level by level from leaf to root).

public class Solution {
public List<List<Integer>> levelOrderBottom(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);
Collections.reverse(result);
return result;
}
}

4ms,beats 10.19%,众数3ms,46.84%
Cmershen的碎碎念：

#### LeetCode --- 107. Binary Tree Level Order Traversal II

2015-04-17 16:46:33

#### leetcode 之Binary Tree Level Order Traversal I和II 解题思路

2014-07-11 23:43:09

#### leetCode解题报告之Binary Tree Level Order Traversal II,I(二叉树层次遍历)

2014-03-28 20:28:01

#### LeetCode 107:Binary Tree Level Order Traversal II

2015-05-31 00:11:23

#### leetcode 107 Binary Tree Level Order Traversal II C++

2016-05-28 20:57:50

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

2016-05-10 14:40:58

#### [LeetCode 107]Binary Tree Level Order Traversal II(递归法）

2016-07-24 17:39:08

#### LeetCode102 Binary Tree Level Order Traversal Java

2016-04-23 14:20:55

#### Binary Tree Level Order Traversal II -- LeetCode

2014-04-11 06:21:49

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

2015-09-11 02:20:37

## 不良信息举报

Easy-题目27：107.Binary Tree Level Order Traversal II