力扣108.将有序数组转换为二叉搜索树

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

思路：

本题通过 数组的索引 来找到 根节点，并通过根节点的左边数组范围来递归构造左子树，通过根节点的右边数组范围来递归构造右子树即可

注意：

获取根节点索引时本应该是 (最右边索引减去最左边索引)/2，但这样对于构造右子树会出现栈溢出，

所以改成了 (nums_end + nums_start) / 2 来获取根节点索引

代码实现

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        return buildTree(nums, 0, nums.length - 1);
    }
	
	public TreeNode buildTree(int[] nums, int nums_start, int nums_end) {
		if (nums_start > nums_end) return null;
		
		int index = (nums_end + nums_start) / 2;
		TreeNode root = new TreeNode(nums[index]);
		root.left = buildTree(nums, nums_start, index - 1);
		root.right = buildTree(nums, index + 1, nums_end);
		
		return root;
	}
}