108. 将有序数组转换为二叉搜索树
问题的关键:选取合适的根节点,让构建出来的树,左右节点分布尽量均匀
/**
* 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}
*/
// 构建高度平衡二叉树,只要选取有序数组的中间值递归添加根节点就行
function buildBST(nums, start, end) {
if(start>end){
return null
}
const MiddleIndex=Math.floor((start+end)/2)
const root=new TreeNode(nums[MiddleIndex])
root.left=buildBST(nums,start,MiddleIndex-1)
root.right=buildBST(nums,MiddleIndex+1,end)
return root
}
var sortedArrayToBST = function (nums) {
return buildBST(nums, 0, nums.length - 1); // 递归的入口
};