/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> lists=new ArrayList<List<Integer>>();
Queue<TreeNode> queue=new LinkedList<TreeNode>();
if(root==null){
return lists;
}
queue.offer(root);
while(!queue.isEmpty()){
List<Integer> list=new ArrayList<Integer>();
int size=queue.size();
while(size>0){
TreeNode t=queue.poll();
list.add(t.val);
if(t.left!=null){
queue.offer(t.left);
}
if(t.right!=null){
queue.offer(t.right);
}
size--;
}
lists.add(list);
}
Collections.reverse(lists);
return lists;
}
}