Describe how you would reverse a singly linked list.

1.	Describe how you would reverse a singly linked list.
Answer» The TASK is to reverse a linked list given a pointer to the HEAD node. By modifying the linkages between nodes, we can reverse the list. Iterative method: Set up three-pointers. prev is set to NULL, curr is set to head, and NEXT is set to NULL. Go through the linked list one by one. Do the following in a loop. // Before CHANGING next of CURRENT, // store next node next = curr->next// Now change next of current // This is where actual reversing happens curr->next = prev // Move prev and curr one step forward prev = curr curr = next

Answer»

The TASK is to reverse a linked list given a pointer to the HEAD node. By modifying the linkages between nodes, we can reverse the list.

Iterative method:

Set up three-pointers. prev is set to NULL, curr is set to head, and NEXT is set to NULL.
Go through the linked list one by one. Do the following in a loop.

// Before CHANGING next of CURRENT, // store next node next = curr->next// Now change next of current // This is where actual reversing happens curr->next = prev // Move prev and curr one step forward prev = curr curr = next

Discussion

No Comment Found

Related InterviewSolutions

How will you delete a node in a doubly-linked list (DLL)?
What are pragma directives?
What is the difference between Manual and Automation Testing.
Describe how you would reverse a singly linked list.
What daemon is responsible for tracking events on your system?
What is marshalling?
What is the difference between array and hash table?
Explain the Unix kernel.
What is a parent/child selector?
What is a virtual memory?

Describe how you would reverse a singly linked list.

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment