A collection that allows speedy insertion and removal of already-located elements in the middle of it is called a ____.
A)linked list
B)stack
C)set
D)queue

Question

Quizplus · Accepted Answer

Linked lists allow for speedy insertion and removal of elements in the middle because they only require adjusting pointers to rearrange the order of elements, rather than having to shift every element in the collection like an array. Stacks, sets, and queues do not offer this same level of flexibility for insertion and removal in the middle.

A Collection That Allows Speedy Insertion and Removal of Already-Located