Suppose you are given the set of integers 1,2,,n for some positive integer n. insert these into a binary search tree so that after the insertions, the search time for the maximum element n in the constructed tree is minimum possible. please explain in which order should you insert them?

B) Apply the same on a max-heap. and please explain

2. Perform a search of an arbitrary element which must not the largest n. Which data structure would you choose? Please explain why