Skip to main content

Reverse a singly linked list

One of the commonly used interview question is - how do you reverse a linked list?

If you talk about a recursive function to print the list in reverse order, you are so wrong. The question is to reverse the nodes of list. Not print the nodes in reverse order.

So how do you go about reversing the nodes.

You need to take each node and link it to previous node. But a singly linked list does not have previous pointer.

So if n1 is current node, n2 = n1->next, you should set

    n2->next = NULL

But doing this would cut off the list at n2.

So the solution is recursion. That is to reverse n nodes  n1,n2,n3... of a list,
  • reverse the sub list from n2,n3,n4....
  • link n2->next to n1
  • set n1->next to NULL
The last step is necessary because, once we reverse the list, first node must become last node and should be pointing to NULL.

But now the difficulty is regarding the head? Where is head and how do we set it?

Once we reach end of list  viz n1->next ==NULL, this node must become new head of the list. We have to store it in a static variable, in order not to change it. 
  1. set current node =n1
  2. if lastnode set head =n1
  3. set node2 = nextnode
  4. recursively reverse list from node2 to end of list
  5. set node2->next = l1
  6. set l1->next = NULL
And here is reverse function


NODEPTR reverse_list(NODEPTR l1)
{
static NODEPTR head;
if(l1->next==NULL)
{
head = l1;
return l1;
}
else
{
NODEPTR node2 = l1->next;
reverse_list(node2);
node2->next = l1;
l1->next = NULL;
return head;
}
}

And this is the complete program.


#include<stdio.h>  
#include<stdlib.h>
struct node
{
int n;
struct node *next;
};
typedef struct node * NODEPTR;

NODEPTR create_node(int value)
{
NODEPTR temp = (NODEPTR) malloc(sizeof(struct node));
temp->next = NULL;
temp->n = value;
return temp;
}

NODEPTR append_node(NODEPTR head, NODEPTR newnode)
{
NODEPTR temp = head;
if(temp==NULL)
return newnode;
while(temp->next !=NULL)
temp = temp->next;
temp->next = newnode;
return head;
}

void display_nodes(NODEPTR head)
{
NODEPTR temp = head;//redundant
while (temp!= NULL)
{
printf("%d====>",temp->n);
temp = temp->next;
}
printf("\n");
}

NODEPTR reverse_list(NODEPTR l1)
{
static NODEPTR head;
if(l1->next==NULL)
{
head = l1;
return l1;
}
else
{
NODEPTR node2 = l1->next;
reverse_list(node2);
node2->next = l1;
l1->next = NULL;
return head;
}
}

NODEPTR delete_node(NODEPTR head, NODEPTR dnode)
{
NODEPTR temp = head;
NODEPTR prev = NULL;
if(dnode==head)
{
head = head->next;
}
while (temp !=NULL && temp!=dnode)
{
prev = temp;
temp = temp->next;
}

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

free(dnode);
return head;
}

int main()
{
NODEPTR head;
NODEPTR newnode,dnode;
int numnodes,i;
//initialize head
head = NULL;
printf("Number of nodes = ");
scanf("%d",&numnodes);

for(i = 0;i<numnodes;i++)
{
int value;
NODEPTR newnode;
printf("node value=");
scanf("%d",&value);
newnode = create_node(value);
head = append_node(head,newnode);
}
printf("The linked list now is ");
display_nodes(head);
head = reverse_list(head);
printf("Now the list is ");
display_nodes(head);
}

You can download the program from here.

Comments

Popular posts from this blog

Delete a node from doubly linked list

Deletion operation in DLL is simpler when compared to SLL. Because we don't have to go in search of previous node of to-be-deleted node.  Here is how you delete a node Link previous node of node of to-be-deleted to next node. Link next node of node of to-be-deleted to previous node. Free the memory of node of to-be-deleted Simple, isn't it. The code can go like this. prevnode = delnode->prev; nextnode = delnode->next; prevnode->next = nextnode; nextnode->prev = prevnode; free(delnode); And that is it. The node delnode is deleted. But we should always consider boundary conditions. What happens if we are trying to delete the first node or last node? If first node is to be deleted, its previous node is NULL. Hence step 3 should not be used.  And also, once head is deleted, nextnode becomes head . Similarly if last node is to be deleted, nextnode is NULL. Hence step 4 is as strict NO NO. And we should set prevnode to tail. After we put these things together, we have...

Function to sort an array using bubble sort

Quick and dirty way of sorting an array is bubble sort. It is very easy to write and follow. But please keep in mind that it is not at all effecient. #include<iostream> using std::cin; using std::cout; void readArray(int arr[],int sz); void printArray(int arr[],int sz); void sortArray(int arr[],int sz); void swap(int &a,int &b); int main() {    int sz;    cout<<"Size of the array=";    cin>>sz;    int arr[sz];    readArray(arr,sz);     sortArray(arr,sz);   cout<<"Sorted array is ";   printArray(arr,sz); } void readArray(int arr[],int sz) {  for(int i=0;i<sz;i++)    {       cout<<"arr["<<i<<"]=";       cin>>arr[i];   } } void printArray(int arr[],int sz) {  for(int i=0;i<sz;i++)    {       cout<<"arr["<<i<<"]=";    ...

Merge two binary search trees

How do you merge two binary search trees? I googled about the solutions. Most solutions told me to convert both trees into linked lists. Merge the lists. Then create a tree from the elements of the list. But why lists? Why can't we store the elements in an array? Because if the data of the tree is larger - not just integer keys, array manipulation becomes difficult. But again, we need not convert both the trees into lists. We can convert one tree into list - a doubly linked list. Then insert the elements of this list into the other tree. I tried this approach. To convert a tree into a sorted doubly linked list Create a doubly linked list. Let the prev and next links of nodes in this list be called left and right respectively. This way we can directly use the binary tree nodes in the list. Use a static variable previousnode  call the function recursively for left child of current node. link current node to the previousnode set next pointer of previousnode to curre...