Convert Sorted Array to Binary Search Tree

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

public class Solution {
    public TreeNode sortedArrayToBST(int[] num) {
        if(num.length==0) return null;
        return get(num,0,num.length-1);
    }
    public TreeNode get(int []num,int start,int end){
        if(start>end) return null;
        int mid = (start+end)/2;
        TreeNode p = new TreeNode (num[mid]);
        p.left = get(num,start,mid-1);
        p.right = get(num,mid+1,end);
        return p;
    }
   
}