update: 108

Author: hijiangtao

README.md

@@ -58,6 +58,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 |102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [JavaScript](./src/binary-tree-level-order-traversal/res.js)|Medium|
 |104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [JavaScript](./src/maximum-depth-of-binary-tree/res.js)|Easy|
 |107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/) | [JavaScript](./src/binary-tree-level-order-traversal-ii/res.js)|Easy|
+|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | [JavaScript](./src/convert-sorted-array-to-binary-search-tree/res.js)|Easy|
 |111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | [JavaScript](./src/minimum-depth-of-binary-tree/res.js)|Easy|
 |120|[Triangle](https://leetcode.com/problems/triangle/) | [JavaScript](./src/triangle/res.js)|Medium|
 |121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [JavaScript](./src/best-time-to-buy-and-sell-stock/res.js)|Easy|

src/convert-sorted-array-to-binary-search-tree/res.js

@@ -0,0 +1,31 @@
+/**
+* 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) {
+const len = nums.length;
+if (!len) return null;
+
+const treeNode = (left, right) => {
+if (left > right) return null;
+const mid = (left + right) >> 1;
+
+const node = {
+val: nums[mid]
+};
+
+node.left = treeNode(left, mid - 1);
+node.right = treeNode(mid+1, right);
+
+return node;
+}
+
+return treeNode(0, len-1);
+};