Multiple Choice
One advantage a linked list has over a vector is that
A) a linked list is smaller than a vector.
B) a linked list can dynamically shrink or grow, and a vector cannot.
C) insertion and removal of items is faster with lists than with vectors.
D) All of the above
E) None of the above
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q7: Deleting an entire linked list requires a
Q7: The defining characteristic of a linked list
Q15: Adding a new node in the middle
Q15: In many recursive operations on linked lists,<br>A)the
Q24: When an item stored in a linked
Q27: A non-empty linked list of items can
Q29: Inserting an item into a linked list
Q32: Deleting an entire list requires traversing the
Q36: In a non-empty list, there must be
Q39: Linked lists are less complex to code