feat: update js solution to lc problem: No.0107 (doocs#1285)

Author: thinkasany

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

@@ -172,7 +172,7 @@ public:
 //   pub left: Option<Rc<RefCell<TreeNode>>>,
 //   pub right: Option<Rc<RefCell<TreeNode>>>,
 // }
-// 
+//
 // impl TreeNode {
 //   #[inline]
 //   pub fn new(val: i32) -> Self {
@@ -273,11 +273,11 @@ func levelOrderBottom(root *TreeNode) [][]int {
  * @return {number[][]}
  */
 var levelOrderBottom = function (root) {
-    let ans = [];
+    const ans = [];
     if (!root) return ans;
-    let q = [root];
+    const q = [root];
     while (q.length) {
-        let t = [];
+        const t = [];
         for (let i = q.length; i > 0; --i) {
             const node = q.shift();
             t.push(node.val);

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

@@ -160,7 +160,7 @@ public:
 //   pub left: Option<Rc<RefCell<TreeNode>>>,
 //   pub right: Option<Rc<RefCell<TreeNode>>>,
 // }
-// 
+//
 // impl TreeNode {
 //   #[inline]
 //   pub fn new(val: i32) -> Self {
@@ -261,11 +261,11 @@ func levelOrderBottom(root *TreeNode) [][]int {
  * @return {number[][]}
  */
 var levelOrderBottom = function (root) {
-    let ans = [];
+    const ans = [];
     if (!root) return ans;
-    let q = [root];
+    const q = [root];
     while (q.length) {
-        let t = [];
+        const t = [];
         for (let i = q.length; i > 0; --i) {
             const node = q.shift();
             t.push(node.val);

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

@@ -11,11 +11,11 @@
  * @return {number[][]}
  */
 var levelOrderBottom = function (root) {
-    let ans = [];
+    const ans = [];
     if (!root) return ans;
-    let q = [root];
+    const q = [root];
     while (q.length) {
-        let t = [];
+        const t = [];
         for (let i = q.length; i > 0; --i) {
             const node = q.shift();
             t.push(node.val);