Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal height.
1