var sortedArrayToBST = function(nums) {
if(!nums.length) return null;
function func(nums, start, end){
if(start > end) return null;
let mid = start + end >>> 1;
const node = new TreeNode(nums[mid]);
node.left = func(nums,start, mid - 1);
node.right = func(nums,mid + 1, end);
return node;
}
return func(nums, 0, nums.length - 1);
}