Create a BST with minimal height by using a sorted array

/**
 * CreateBSTWithMinimalHeight.java
 * 
 * Description: Given a sorted (increasing order) array with unique
integer
 * elements, write an algorithm to create a binary search tree with
minimal
 * height.
 * 
 * @author John Qiao <qiaoshun8888@gmail.com> Date: Jan 23, 2014
 */