Linked List Reversal

Reverse a singly linked list by reassigning one pointer at a time. The whole difficulty is that overwriting next destroys your route to the rest of the list, so it must be saved first.