Skip to main content

Remove duplicates from linked list

Question:
Write a program to remove all duplicates from a singly linked list.

For example, if the list is
2-->4--->5--->7--->2---->5--->25--->2

after deletion, the output must be something like this
2-->4-->5-->7-->25


An easy solution would be to take one node at a time, compare its value with all the other nodes, and delete if there is a match. But that would be expensive.

A better solution is to sort the list and then compare adjacent values.

 Here is how we do it.
  1. Take a sorted list
  2. Compare a node with its previous node.
  3. If they have same value, delete the node
  4. Move to next node
  5. Repeat steps 2 to 4 until end of list
But you should be careful in step 4. Because if you say, node->next, you may use a dangling pointer.

For sorting the list, you can use any algorithm. Insertion sort is easiest for linked lists.

Let us look at the code.


void remove_duplicates(NODEPTR head)
{
    head = sort_list(head);
    NODEPTR temp=head;
    NODEPTR prev_node  = temp;
    temp = temp->next;
    while(temp!=NULL)
    {
        if(temp->n == prev_node->n)
        /* we have duplicate. Delete it*/
        {
             delete_nextnode(prev_node);             
             temp = prev_node->next;
        }else
        {
            prev_node = temp;
            temp = temp->next;
         }
    }
}

We are starting from second node and comparing each node with its previous node. Initial value of prev_node is head and temp is second node. When the values are equal we are calling delete_nextnode() function which will delete the next node of prev_node. Then we move to next node, not using temp = temp->next but using temp = prevnode->next.

If there is no match, we just move to next node.

delete_nextnode() used here is a simple function, which deletes the next node of its parameter. Here is the code for it.


void delete_nextnode(NODEPTR temp)
{
     if(temp->next)
     {
        NODEPTR d1 = temp->next;
        temp->next = temp->next->next;
 free(d1);
     }
}

You can download the driver program from here.
Labels:

Comments

Post a Comment

Popular posts from this blog

In order traversal of nodes in the range x to y

Question : Write a function for in-order traversal of nodes in the range x to y from a binary search tree. This is quite a simple function. As a first solution we can just traverse our binary search tree in inorder and display only the nodes which are in the range x to y. But if the current node has a value less than x, do we have to traverse its left subtree? No. Because all the nodes in left subtree will be smaller than x. Similarly if the current node has a key value more than y, we need not visit its right subtree. Now we are ready to write our algorithm.     if nd is NOT NULL  if nd->val >=x then visit all the nodes of left subtree of nd recursively display nd->val if nd->val <y then visit all the nodes of right subtree of nd recursively  That's all. We have our function ready. void in_order_middle (NODEPTR nd, int x, int y) { if (nd) { if (nd -> val >= x) in_order_middle(nd...
Post a Comment
Read more

Josephus problem

Question: Write a function to delete every k th node from circular linked list until only one node is left. This has a story associated with it. Flavius Josephus was Jewish Historian from 1st century. He and 40 other soldiers were trapped in a cave by Romans. They decided to kill themselves rather than surrendering to Romans. Their method was like this. All the soldiers will stand in a circle and every k th soldier will be shot dead. Josephus said to have calculated the starting point so that he would remain alive. So we have similar problem at hand. We delete every kth node in a circular list. Eventually only one node will be left. e.g. Let us say this is our list And we are deleting every third node.  We will delete 30. Then we delete 60. Next we delete 10. Next it will be 50. Next to be deleted is 20. Next 80. This continues. Implementation   We can count k-1 nodes and delete next node. This can be repeated in  a loop. What must be the termina...
Post a Comment
Read more

Lowest common ancestor of binary search tree

Question : Write a function to print the lowest common ancestor of two nodes in a binary search tree.  Lowest common ancestor of two nodes x and y in a binary tree is the lowest node that has both x and y as descendants. Here lowest common ancestor of 1 and 7 is 3. LCA of 13 and 7 is root - 8. And LCA of 6 and 7 is 6 itself. The program to find gets complicated for an ordinary binary tree. But for a binary search tree, it is quite simple. As we see from the diagram above, the paths to 1 and 4 are common till the node 3. And at 3 they branch in different directions. So 3 is our LCA. That is lowest common ancestor is the node where the paths to x and y from root deviate. As long as they branch in same direction, we continue to traverse. When they branch in different directions, that is the lowest common ancestor. So let us write a simple algorithm, set temp=root if temp->val >x and temp->val>y temp = temp->left else if temp->val<x and ...
Post a Comment
Read more