Javascript beats 88% recursive without slicing array
\nvar sortedArrayToBST = function(nums) {\n    if (!nums) {\n        return null;\n    }\n    return helper(nums, 0, nums.length - 1);\n}\n\nvar helper = functi
```\nvar sortedArrayToBST = function(nums) {\n    if (!nums) {\n        return null;\n    }\n    return helper(nums, 0, nums.length - 1);\n}\n\nvar helper = function(nums, low, high) {\n    if (low > high) { // Done\n        return null;\n    }\n    var mid = (low + (high - low) / 2)>>0;\n    var node = new TreeNode(nums[mid]);\n    node.left = helper(nums, low, mid - 1);\n    node.right = helper(nums, mid + 1, high);\n    return node;\n}\n```
['Recursion', 'JavaScript']