closed by
356 views
1 votes
1 votes
closed with the note: Duplicate of : https://gateoverflow.in/116846/ds

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

T = max ( T_{INSERT} ,T_{DELETE}, T_{FINDCLOSEST} )

where T_{op} 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

closed by

Related questions

0 votes
0 votes
1 answer
3
smartmeet asked Feb 8, 2017
503 views
Which of the following statements is FALSE?(A) Each thread has own stack(B) Starvation implies deadlock(C) Smaller page size increases the page table size(D) User level p...
0 votes
0 votes
1 answer
4