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
Q11: In a non-empty list, there must be
Q12: Each node in a list contains pointers
Q13: A _ is used to step through
Q14: The of a linked list points to
Q15: The list container provided by the Standard
Q16: If new information needs to be added
Q17: A non-empty linked list of items can
Q18: The STL implementation of a linked list
Q19: In a doubly- linked list, each node
Q20: A linked list class using dynamically allocated
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents