JavaScript simple recursive
\nvar sortedArrayToBST = function(nums) {\n    if(!nums.length) return null;\n    let mid = Math.floor(nums.length/2);\n    let node = new TreeNode(nums[mid]);\
```\nvar sortedArrayToBST = function(nums) {\n    if(!nums.length) return null;\n    let mid = Math.floor(nums.length/2);\n    let node = new TreeNode(nums[mid]);\n    node.left = sortedArrayToBST(nums.slice(0,mid));\n    node.right = sortedArrayToBST(nums.slice(mid+1));\n    return node;\n};\n```\nConsider upvote if you find it helpful
['Recursion', 'JavaScript']