Convert Sorted Array to Binary Search Tree LeetCode solution in JavaScript

1
var sortedArrayToBST = function (nums) {
2
  if (nums.length === 0) return null;
3
  // array length - 1 divided by 2
4
  let mid = (nums.length - 1) >> 1;
5
  let node = new TreeNode(nums[mid]);
6
  node.left = sortedArrayToBST(nums.slice(0, mid));
7
  node.right = sortedArrayToBST(nums.slice(mid + 1));
8
  return node;
9
};