Multiple Choice
The STL implementation of a linked list is a class called
A) DynamicList.
B) list.
C) LinkedList.
D) dequeue.
E) None of the above
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q2: If new information needs to be added
Q7: The defining characteristic of a linked list
Q7: Deleting an entire linked list requires a
Q8: Nodes in a linked list are stored
Q11: One advantage a linked list has over
Q15: Adding a new node in the middle
Q26: A linked list can grow and shrink
Q27: A non-empty linked list of items can
Q29: Inserting an item into a linked list
Q38: A new node cannot become the first