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 system's memory deallocator.
B) the class destructor.
C) overriding the class removal function.
D) overloading the class removal function.
E) None of the above
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q6: A list that contains pointers to the
Q8: Nodes in a linked list are stored
Q17: To concatenate two linked lists, it is
Q19: The successor pointer in the last node
Q20: In many recursive operations on linked lists,<br>A)
Q22: When you delete a node from a
Q23: Which of the following are linked list
Q24: When an item stored in a linked
Q38: A new node cannot become the first
Q39: Linked lists are less complex to code