Linked List

Pointer-based linear structures where traversal and mutation are explicit operations.

Linked lists trade random access for cheap local rewiring. They are best understood through pointer movement, node ownership, and mutation safety.

Pointer-based linear structures where traversal and mutation are explicit operations.

Losing the rest of the list before storing the next pointer.

Handling the head as a special case in every branch instead of using a sentinel.