1class Solution {2    public TreeNode sortedArrayToBST(int[] nums) {3        return build(nums, 0, nums.length - 1);4    }5    private TreeNode build(int[] nums, int left, int right) {6        if (left > right) return null;7        int mid = left + (right - left) / 2;8        TreeNode root = new TreeNode(nums[mid]);9        root.left = build(nums, left, mid - 1);10        root.right = build(nums, mid + 1, right);11        return root;12    }13}