0108.将有序数组转换为二叉搜索树

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {number[]} nums
 * @return {TreeNode}
 */
var sortedArrayToBST = function (nums) {
  const to = (left, right) => {
    if (left > right) return null;
    const mid = Math.floor(left + (right - left) / 2);
    return new TreeNode(nums[mid], to(left, mid - 1), to(mid + 1, right));
  };

  return to(0, nums.length - 1);
};