Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) defined to be some element x in the current set such that|x-y| ≤ |xi-y| for all xi in the current set. Let
where denotes the worst-case time complexity for the given operation OP. Which of the following data structures would be best to use in order to minimizeT?
(A) A sorted list
(B) An unordered list
(C) An implicit heap
(D) An AVL tree