1. use binary search to find mid point
2. and recursion to find sub mid points. eg. if mid is found , then find (0, mid-1), and (mid+1, end
3. recursively construct BST