What does the clear() method do in the LList class?

• A. It clears the list but preserves the allocated memory.
• B. It removes all nodes and resets the list.
• C. It only empties the first node.
• D. It performs a shallow clear without deallocating nodes.

Answer: (B)

The method tested is about fully cleaning up and resetting the list. In a linked list, clear should remove every node by deallocating them, then reset the list’s internal state so it behaves like a brand-new empty list. Practically, that means deleting all nodes, setting the head (and usually the tail) to null, and resetting the size counter to zero. This makes the list truly empty and ready for fresh inserts. It isn’t about just removing the first node, nor about a shallow reset that leaves nodes allocated or memory leaks behind. The goal is to reclaim memory and leave no remaining elements or stale references.