public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> res = new LinkedList<>();
if (root == null) return res;
LinkedList<TreeNode> queue = new LinkedList<>();
queue.add(root);
while (!queue.isEmpty()){
List<TreeNode> list = new LinkedList<>();
int size = queue.size();
for (int i = 0;i < size;i++){
list.add(queue.poll());
}
List<Integer> integerList = new LinkedList<>();
for (TreeNode item:list){
integerList.add(item.val);
if (item.left != null) queue.addFirst(item.left);
if (item.right != null) queue.addFirst(item.right);
}
res.add(integerList);
}
Collections.reverse(res);
return res;
}
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> res = new LinkedList<>();
if (root == null) return res;
LinkedList<TreeNode> queue = new LinkedList<>();
queue.add(root);
while (!queue.isEmpty()){
List<Integer> integerList = new LinkedList<>();
int size = queue.size();
for (int i = 0;i <size;i++){
TreeNode node = queue.poll();
integerList.add(node.val);
if (node.left != null) queue.add(node.left);
if (node.right != null) queue.add(node.right);
}
res.add(0,integerList);
}
return res;
}