# Removing Duplicates from a List

### Procedure  :

* Traverse the list until the next node is not NULL.
* If the data of current node and next node is the same, change the next of current node to next of next node and delete the next node.
* Else, move the current node to next of current node.

```c
void removeDuplicates(struct node *ptr) {

    while (ptr -> next != NULL) {

        // If data of the two nodes are same
        if (ptr -> data == ptr -> next -> data) {
            // Pointer for the node to be deleted
            struct node *toDelete = ptr -> next;
            // Replace the links
            ptr -> next = toDelete -> next;
            // Deallocate the memory
            free(toDelete);
        }
        
        // IMPORTANT : Advance only if no deletion
         else {
            ptr = ptr -> next;
        }
        
    }
    
}
```

Contributed by Nitin Ranganath


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://nitinranganath.gitbook.io/data-structures/linked-list/removing-duplicates-from-a-list.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.