Home Questions Search Forum Contact Guest Book Polls! Got a Question?
PREV Linked Lists NEXT   (17 / 301)     Write a C program to remove duplicates from a sorted linked list As the linked list is sorted, we can start from the beginning of the list and compare adjacent nodes. When adjacent nodes are the same, remove the second one. There's a tricky case where the node after the next node needs to be noted before the deletion. // Remove duplicates from a sorted list void RemoveDuplicates(struct node* head)  {   struct node* current = head;   if (current == NULL) return; // do nothing if the list is empty   // Compare current node with next node   while(current->next!=NULL)    {       if (current->data == current->next->data)        {          struct node* nextNext = current->next->next;          free(current->next);          current->next = nextNext;       }       else        {          current = current->next; // only advance if no deletion       }    } } PREV COMMENTS                                  INDEX                                  PRINT NEXT Last updated: November 3, 2005 www.cracktheinterview.com - Your destination for the most common IT interview questions, answers, frequently asked interview questions (FAQ), C Programs, C Datastructures for technical interviews conducted by the top IT companies around the world!