Intuitive Javascript Solution
\nvar sortedArrayToBST = function(nums) {\n    if (!nums.length) return null;\n    \n    const mid = Math.floor(nums.length / 2);\n    const root = new TreeNode
```\nvar sortedArrayToBST = function(nums) {\n    if (!nums.length) return null;\n    \n    const mid = Math.floor(nums.length / 2);\n    const root = new TreeNode(nums[mid]);\n    \n    // subtrees are BSTs as well\n    root.left = sortedArrayToBST(nums.slice(0, mid));\n    root.right = sortedArrayToBST(nums.slice(mid + 1));\n    \n    return root;\n};\n```
['Recursion', 'JavaScript']