Linked List Pointer Updates

Linked-list problems are about preserving access while changing arrows. Because each node only knows its next pointer, interviews reward students who save the next node before rewiring and who reason locally about what each pointer update does to the rest of the list.