Design a simple algorithm by giving pseudocode, for constructing a binary search tree T on n elements in O(nlogn) time with the property that any Find operation on T takes O(logn) time.

(Note: Your algorithm should not use complex operations like insert on a height-balanced search tree such as a red-black tree. The goal is to achieve the above time bounds using a very simple approach.)

(Hint: First sort the n elements. )