class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> res = new LinkedList<>();
Deque<List<Integer>> stack = new LinkedList<>();
Deque<TreeNode> que = new LinkedList<>();
if(root != null){
que.offer(root);
}
while (!que.isEmpty()){
int size = que.size();
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) {
TreeNode temp = que.poll();
list.add(temp.val);
if(temp.left != null){
que.offer(temp.left);
}
if(temp.right != null){
que.offer(temp.right);
}
}
res.add(0,list);
}
return res;
}
}