feat: add solution of Convert Sorted Array to Binary Search Tree(108) with javascript.

Author: taryn2016

README.md

@@ -76,8 +76,8 @@
 | [100][100-question] | [Same Tree][100-tips]                                        | [Easy][E]   | [✅][100-java] | [✅][100-js] | [✅][100-kotlin] |
 | [101][101-question] | [Symmetric Tree][101-tips]                                   | [Easy][E]   | [✅][101-java] | [✅][101-js] | [✅][101-kotlin] |
 | [104][104-question] | [Maximum Depth of Binary Tree][104-tips]                     | [Easy][E]   | [✅][104-java] | [✅][104-js] | [✅][104-kotlin] |
-| [107][107-question] | [Binary Tree Level Order Traversal II][107-tips]             | [Easy][E]   | [✅][107-java] |              | [✅][107-kotlin] |
-| [108][108-question] | [Convert Sorted Array to Binary Search Tree][108-tips]       | [Easy][E]   | [✅][108-java] |              | [✅][108-kotlin] |
+| [107][107-question] | [Binary Tree Level Order Traversal II][107-tips]             | [Easy][E]   | [✅][107-java] | [✅][107-js] | [✅][107-kotlin] |
+| [108][108-question] | [Convert Sorted Array to Binary Search Tree][108-tips]       | [Easy][E]   | [✅][108-java] | [✅][108-js] | [✅][108-kotlin] |
 | [110][110-question] | [Balanced Binary Tree][110-tips]                             | [Easy][E]   | [✅][110-java] |              | [✅][110-kotlin] |
 | [111][111-question] | [Minimum Depth of Binary Tree][111-tips]                     | [Easy][E]   | [✅][111-java] |              | [✅][111-kotlin] |
 | [112][112-question] | [Path Sum][112-tips]                                         | [Easy][E]   | [✅][112-java] |              | [✅][112-kotlin] |
@@ -456,6 +456,8 @@ commit信息模板: ``feat: add the solution of `Two Sum`(001) with Java``
 [100-js]: ./src/_100/Solution.js
 [101-js]: ./src/_101/Solution.js
 [104-js]: ./src/_104/Solution.js
+[107-js]: ./src/_107/Solution.js
+[108-js]: ./src/_108/Solution.js
 [226-js]: ./src/_226/Solution.js
 [561-js]: ./src/_561/Solution.js
 [643-js]: ./src/_643/Solution.js

src/_108/Solution.js

@@ -0,0 +1,21 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {number[]} nums
+ * @return {TreeNode}
+ */
+var sortedArrayToBST = function(nums) {
+  if (nums == null || !nums.length) {
+      return null;
+  }
+  let mid = Math.floor(nums.length / 2)
+  let rootNode = new TreeNode(nums[mid])
+  rootNode.left = sortedArrayToBST(nums.slice(0, mid))
+  rootNode.right = sortedArrayToBST(nums.slice(mid+1))
+  return rootNode
+};

tips/101/README.md

@@ -78,6 +78,19 @@ class Solution {
 }
 ```
 
+
+```javascript
+var isSymmetric = function(root) {
+    if(root == null) return true
+    var x = function(left, right) {
+        if(left == null && right == null) return true
+        if(left == null || right == null) return false
+        if (left.val !== right.val) return false;
+        return x(left.left, right.right) && x(left.right, right.left) 
+    }
+    return x(root.left, root.right)
+};
+```
 ## 思路 1
 
 第二种思路就是宽搜了，宽搜肯定要用到队列，Java 中可用 `LinkedList` 替代，也是要做到左子树的左节点和右子树的右节点，左子树的右节点和右子树的左节点做比较即可。

tips/104/README.md

@@ -44,6 +44,12 @@ class Solution {
 }
 ```
 
+```javascript
+var maxDepth = function(root) {
+    if (root == null) return 0;
+     return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
+};
+```
 ## 结语
 
 如果你同我们一样热爱数据结构、算法、LeetCode，可以关注我们 GitHub 上的 LeetCode 题解：[LeetCode-Solution][ls]

tips/107/README.md

@@ -119,6 +119,25 @@ class Solution {
 }
 ```
 
+```javascript
+var levelOrderBottom = function(root) {
+    if (root === null) { return []; }
+    let result = [];
+    let queue = [root];
+    while(queue.length > 0) {
+        let size = queue.length;
+        let current = [];
+        for (let i = 0; i < size; i++) {
+            let head = queue.shift();
+            current.push(head.val);
+            if(head.left !== null) { queue.push(head.left); }
+            if(head.right !== null) { queue.push(head.right); }
+        }
+        result.unshift(current);
+    }
+    return result;
+};
+```
 ## 结语
 
 如果你同我们一样热爱数据结构、算法、LeetCode，可以关注我们 GitHub 上的 LeetCode 题解：[LeetCode-Solution][ls]

tips/108/README.md

@@ -85,6 +85,18 @@ class Solution {
 }
 ```
 
+```javascript
+var sortedArrayToBST = function(nums) {
+  if (nums == null || !nums.length) {
+      return null;
+  }
+  let mid = Math.floor(nums.length / 2)
+  let rootNode = new TreeNode(nums[mid])
+  rootNode.left = sortedArrayToBST(nums.slice(0, mid))
+  rootNode.right = sortedArrayToBST(nums.slice(mid+1))
+  return rootNode
+};
+```
 ## 结语
 
 如果你同我们一样热爱数据结构、算法、LeetCode，可以关注我们 GitHub 上的 LeetCode 题解：[LeetCode-Solution][ls]