remove_duplicates_soreted_linked_list.cpp

#include<bits/stdc++.h>
using namespace std;

struct node{
    int data;
    struct node* next;
};

struct node* createList(struct node* head, int data){
    struct node *tmp=(struct node*)malloc(sizeof(struct node));
    tmp->data=data;
    tmp->next=NULL;
    if(head==NULL){
        head=tmp;
        return head;
    }
    struct node* p=head;
    while(p->next!=NULL){
        p=p->next;
    }
    p->next=tmp;
    return head;
}

void disp(struct node* head){
    struct node* p=head;
    while(p!=NULL){
        cout<<p->data<<" ";
        p=p->next;
    }
}

void removeDuplicate(struct node* head){
    struct node* tmp=head;
    while(tmp!=NULL && tmp->next!=NULL){
        if(tmp->data==tmp->next->data){
            struct node* toRemove=tmp->next;
            tmp->next=tmp->next->next;
            free(toRemove);
        }
       else tmp=tmp->next;
    }
}

int main(){
    struct node* head=NULL;
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        int data;
        cin>>data;
        head=createList(head, data);
    }
    disp(head);
    cout<<endl;
    removeDuplicate(head);
    disp(head);
}