Question

Which data structure require least amount of time to perform insert,delete and search operations.​

Answer 1

Explanation:

A linked list provides efficient insertion and deletion of arbitrary elements. Deletion here is deletion by iterator, not by value. Traversal is quite fast. A dequeue provides efficient insertion and deletion only at the ends, but those are faster than for a linked list, and traversal is faster as well.