Multiple Choice
One advantage a linked list has over a vector is that
A) a linked list can dynamically shrink or grow, and a vector cannot.
B) a linked list is smaller than a vector.
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
Q4: To build a linked list, we can<br>A)
Q5: The values stored in the value portion
Q6: If the head pointer points to NULL,
Q7: Deleting an entire linked list requires a
Q8: A _ is used to step through
Q10: Moving through a linked list is referred
Q11: If a node is not the first
Q12: The _ of a linked list points
Q13: Variations of the linked list are<br>A) doubly-linked
Q14: Each node in a _ list contains