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
Get step-by-step solutions from verified subject matter experts
