feat: update solutions to leetcode problem

Author: yanglbme

solution/0100-0199/0107.Binary Tree Level Order Traversal II/README.md

@@ -84,8 +84,8 @@ class Solution {
     public List<List<Integer>> levelOrderBottom(TreeNode root) {
         if (root == null) return Collections.emptyList();
         Deque<TreeNode> q = new ArrayDeque<>();
-        q.offer(root);
         List<List<Integer>> res = new ArrayList<>();
+        q.offer(root);
         while (!q.isEmpty()) {
             int size = q.size();
             List<Integer> t = new ArrayList<>();
@@ -95,9 +95,8 @@ class Solution {
                 if (node.left != null) q.offer(node.left);
                 if (node.right != null) q.offer(node.right);
             }
-            res.add(t);
+            res.add(0, t);
         }
-        Collections.reverse(res);
         return res;
     }
 }

solution/0100-0199/0107.Binary Tree Level Order Traversal II/README_EN.md

@@ -98,8 +98,8 @@ class Solution {
     public List<List<Integer>> levelOrderBottom(TreeNode root) {
         if (root == null) return Collections.emptyList();
         Deque<TreeNode> q = new ArrayDeque<>();
-        q.offer(root);
         List<List<Integer>> res = new ArrayList<>();
+        q.offer(root);
         while (!q.isEmpty()) {
             int size = q.size();
             List<Integer> t = new ArrayList<>();
@@ -109,9 +109,8 @@ class Solution {
                 if (node.left != null) q.offer(node.left);
                 if (node.right != null) q.offer(node.right);
             }
-            res.add(t);
+            res.add(0, t);
         }
-        Collections.reverse(res);
         return res;
     }
 }

solution/0100-0199/0107.Binary Tree Level Order Traversal II/Solution.java

@@ -11,8 +11,8 @@ class Solution {
     public List<List<Integer>> levelOrderBottom(TreeNode root) {
         if (root == null) return Collections.emptyList();
         Deque<TreeNode> q = new ArrayDeque<>();
-        q.offer(root);
         List<List<Integer>> res = new ArrayList<>();
+        q.offer(root);
         while (!q.isEmpty()) {
             int size = q.size();
             List<Integer> t = new ArrayList<>();
@@ -22,9 +22,8 @@ public List<List<Integer>> levelOrderBottom(TreeNode root) {
                 if (node.left != null) q.offer(node.left);
                 if (node.right != null) q.offer(node.right);
             }
-            res.add(t);
+            res.add(0, t);
         }
-        Collections.reverse(res);
         return res;
     }
 }