Suppose you have an unsorted array of n numbers. Give a divide-&-conquer algorithm to construct a complete binary search tree containing the data items of the array. Each node in the tree is represented by a record of 3 fields: data field, left-pointer and right-pointer. Give the time complexity of your algorithm.