Explain the logic for reversing a linked list, and then write the code to implement it.

Reversing a linked list involves changing the direction of the pointers in the list.

• Iterate through the list and change the direction of the pointers

• Use three pointers to keep track of the current nod...read more

Initialize three pointers prev as NULL, curr as head and next as NULL. Iterate trough the linked list. In loop, do following.// Before changing next of current,// store next nodenext = curr->next //...read more