Question: Can someone explain to me how this algorithm works to reverse a linked list? node *reverseList(node *head) { node *curr = head; node *prev =

Can someone explain to me how this algorithm works to reverse a linked list?

node *reverseList(node *head) { node *curr = head; node *prev = NULL; node *temp = NULL;

while (curr != NULL) { temp = curr->next; curr->next = prev; prev = curr; curr = temp; }

return prev; }

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!