Algorithm

The core idea is to change the next pointers of the nodes one by one so that they point backward instead of forward. By maintaining references to the current node, its previous node, and the next node, we can safely rewire the links without losing track of the list. Once all links are reversed, the last node of the original list becomes the new head.

Initialize a traversal pointer at the head of the linked list.
Also initialize a pointer for the previous node and set it to NULL.
Repeat the following steps until the traversal pointer reaches the end:

Save the next node in a temporary pointer.
Reverse the `next` pointer of the current node to point to the previous node.
Move the previous pointer to the current node.
Advance the traversal pointer to the next node (saved earlier).

Once the traversal is complete, return the previous node as the new head of the reversed list.