Java | Leetcode Java题解之第108题将有序数组转换为二叉搜索树

题目：

题解：

class Solution {    Random rand = new Random();    public TreeNode sortedArrayToBST(int[] nums) {        return helper(nums, 0, nums.length - 1);    }    public TreeNode helper(int[] nums, int left, int right) {        if (left > right) {            return null;        }        // 选择任意一个中间位置数字作为根节点        int mid = (left + right + rand.nextInt(2)) / 2;        TreeNode root = new TreeNode(nums[mid]);        root.left = helper(nums, left, mid - 1);        root.right = helper(nums, mid + 1, right);        return root;    }}