Binary search trees have their best performance when they are balanced, which means that at each node n, the size of the left subtree of n is within one of the size of the right subtree of n. Write a static method that takes a sorted array of integers and produces a balanced binary search tree. (The array is sorted with smallest integers at the front and largest at the end.) 

If useful, you can add extra parameters to the method, such as the total number of entries in the list. 

As an alternative, you can have the integer data come from a Java Vector rather than an array.