A ____ is a data structure used for collecting a sequence of objects that allows efficient addition and removal of already-located elements in the middle of the sequence.
A)queue
B)priority queue
C)stack
D)linked list

Question

Quizplus · Accepted Answer

A linked list allows efficient addition and removal of already-located elements in the middle of the sequence by simply updating pointers to redirect the list around the removed or added item. Queues, priority queues, and stacks are also data structures, but they do not allow efficient removal of elements in the middle of the sequence.

A ____ Is a Data Structure Used for Collecting a Sequence