Added sortedArrayToBST.js

jonasraoni · jonasraoni · commit 9c7f218a544b · 2023-03-31T13:55:08.000+03:00
diff --git a/easy/sortedArrayToBST.js b/easy/sortedArrayToBST.js
@@ -0,0 +1,20 @@
+//+ Jonas Raoni Soares Silva
+//@ http://raoni.org
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {number[]} nums
+ * @return {TreeNode}
+ */
+var sortedArrayToBST = function(nums) {
+    return new function nodeFromMiddle(start = 0, end = nums.length - 1, middle = (start + end) >> 1) {
+        return end < start || start >= nums.length ? null : new TreeNode(nums[middle], nodeFromMiddle(start, middle - 1), nodeFromMiddle(middle + 1, end));
+    };
+};
diff --git a/easy/sortedArrayToBST.md b/easy/sortedArrayToBST.md
@@ -0,0 +1,28 @@
+# [108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)
+
+Given an integer array nums where the elements are sorted in ascending order, convert it to a 
+height-balanced
+ binary search tree.
+
+ 
+
+Example 1:
+
+
+Input: nums = [-10,-3,0,5,9]
+Output: [0,-3,9,-10,null,5]
+Explanation: [0,-10,5,null,-3,null,9] is also accepted:
+
+Example 2:
+
+
+Input: nums = [1,3]
+Output: [3,1]
+Explanation: [1,null,3] and [3,1] are both height-balanced BSTs.
+ 
+
+Constraints:
+
+1 <= nums.length <= 104
+-104 <= nums[i] <= 104
+nums is sorted in a strictly increasing order.
