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

Verified
Correct Answer:
Verified
Related Questions
Q6: A list that contains pointers to the
Q26: A linked list can grow and shrink
Q27: A non-empty linked list of items can
Q28: Linked lists of items are commonly implemented
Q29: Inserting an item into a linked list
Q30: The list container provided by the Standard
Q32: Deleting an entire list requires traversing the
Q33: The Standard Template Library (STL) provides a
Q34: When using a node pointer to traverse
Q36: In a non-empty list, there must be