Reverse a linked list.

To reverse a linked list, you can iterate through the list, changing the next pointer of each node to point to its previous node. You'll need three pointers: one for the current node, one for the previous node (initially null), and one to temporarily store the next node before modifying the current node's pointer. After iterating through the entire list, the original tail will become the new head.