Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {    public TreeNode sortedArrayToBST(int[] nums) {        int start = 0;        int end = nums.length-1;        return sort(nums,start,end);    }        private TreeNode sort(int[] nums, int start, int end){        if(start > end){            return null;        }        TreeNode node = new TreeNode(nums[(start+end)/2]);        node.left = sort(nums,start,(start+end)/2-1);        node.right = sort(nums,(start+end)/2+1,end);        return node;    }}