二叉树：23 将有序数组转换为二叉搜索树

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

/**
 * 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 buildBST(nums, 0, nums.length);
    }
    TreeNode buildBST(int[] nums, int left, int right) {//左闭右开
        //以中值构造节点，两半部分的值分别为两颗子树，递归出答案
        if(left >= right) return null;//如果区间是非法区间就返回null

        int middle = (left + right) / 2;
        TreeNode root = new TreeNode(nums[middle]);
        root.left = buildBST(nums, left, middle);
        root.right = buildBST(nums, middle + 1, right);

        return root;
    }
}