Recursive | Simple | Fast | JavaScript Solution
\nvar sortedArrayToBST = function(nums, start=0, end = nums.length-1) {\n    if(start<=end){\n        let mid = Math.floor((start+end)/2);\n        // console.l
```\nvar sortedArrayToBST = function(nums, start=0, end = nums.length-1) {\n    if(start<=end){\n        let mid = Math.floor((start+end)/2);\n        // console.log(mid, end)\n        let root = new TreeNode(nums[mid]);\n        root.left = sortedArrayToBST(nums, start, mid-1);\n        root.right = sortedArrayToBST(nums, mid+1, end);\n        return root;\n    }\n    return null;\n};\n```
['Recursion', 'JavaScript']