108. Convert Sorted Array to Binary Search Tree

 

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

class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
         return nums.length==0? null : ToBST(nums,0,nums.length-1);
        
        
    }
    public TreeNode ToBST(int[] nums,int lo,int hi) {
        if(lo>hi) return null;
         int mid = (lo+hi)/2;
         TreeNode root = new TreeNode(nums[mid]);
         root.left = ToBST(nums,lo,mid-1);
         root.right = ToBST(nums,mid+1,hi);
         
        return root;
        
    }
}