The advantage a linked list has over a vector is:
A)A linked list can dynamically shrink or grow, and a vector cannot
B)A linked list is smaller than a vector
C)A node can be inserted into or removed from a linked list faster than from a vector
D)Data removal and insertion are more accurate with a linked list than with a vector
E)None of these

Question

Quizplus · Accepted Answer

Linked list allocation and deallocation take place during runtime, allowing it to dynamically shrink or grow as needed. This is not possible with vectors. Additionally, inserting or removing a node in a linked list can be accomplished in constant time, while the same operation in a vector can take linear time, since all the elements following the point of insertion or removal may need to be repositioned. However, the size of a linked list and a vector is determined by the number of nodes/elements they respectively contain, so choice (B) is incorrect. Choice (D) is also incorrect since both data structures can perform insertion and removal accurately, but at different speeds. Choice (E) is incorrect since there is an advantage of linked lists over vectors.

The Advantage a Linked List Has Over a Vector Is