Javascript Accepted Solution
\nvar sortedArrayToBST = function(nums) {\n    if(!nums.length) return null;   \n    var mid = Math.floor((nums.length)/2);\n    var root = new TreeNode(nums[mi
```\nvar sortedArrayToBST = function(nums) {\n    if(!nums.length) return null;   \n    var mid = Math.floor((nums.length)/2);\n    var root = new TreeNode(nums[mid]);\n    root.left = sortedArrayToBST(nums.slice(0, mid));\n    root.right = sortedArrayToBST(nums.slice(mid+1));\n    return root;\n}\n```
[]