/**
* 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) {
LinkedList<List<Integer>> result=new LinkedList<>();
if(root==null) return result;
TreeNode t;
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
ArrayList<Integer> arrayList=new ArrayList<>();
int size=queue.size();
for(int i=0;i<size;i++){
t=queue.poll();
arrayList.add(t.val);
if(t.left!=null) queue.offer(t.left);
if(t.right!=null) queue.offer(t.right);
}
result.add(0,arrayList);
}
return result;
}
}