Multiple Choice
The defining characteristic of a linked list is that
A) lists are very efficient at storing data.
B) the locations that store list data do not have to be consecutive in memory.
C) data are stored in consecutive locations in the memory of the computer.
D) the maximum size of a list is fixed when the list is created.
E) None of the above
Correct Answer:

Verified
Correct Answer:
Verified
Q2: If new information needs to be added
Q5: The STL implementation 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
Q39: Linked lists are less complex to code