Multiple Choice
A linked list class using dynamically allocated memory should free its memory when the list is destroyed. This can be done by
A) the class destructor.
B) overriding the class removal function.
C) the system's memory deallocator.
D) overloading the class removal function.
E) None of the above
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q11: If a node is not the first
Q22: When you delete a node from a
Q23: To build a linked list, we can<br>A)start
Q24: In a doubly- linked list, each node
Q25: Variations of the linked list are<br>A)circular linked
Q29: The of a linked list points to
Q30: When using a node pointer to traverse
Q31: The list container provided by the Standard
Q32: A _ is used to step through
Q33: The successor pointer in the last node