class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
if(root == null) return res;
int level = 0;
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
while(!queue.isEmpty()) {
int l = queue.size();
res.add(new ArrayList<Integer>());
for(int i = 0; i < l; i ++) {
TreeNode node = queue.poll();
res.get(level).add(node.val);
if(node.left != null) queue.add(node.left);
if(node.right != null) queue.add(node.right);
}
level ++;
}
return Collections.reverse(res);
return res;
}
}