struct node *temp,*temp2;

temp=head;
while(temp!=NULL)
{
head1 = InsertInOrder(head1,temp->val);
temp=temp->ptr;
}
temp2=head1;
while(temp2->ptr!=NULL)
{
if(temp2->val == temp2->ptr->val)
{
struct node *NTD;
NTD=temp2->ptr;
temp2->ptr=temp2->ptr->ptr;
free(NTD);
}
temp2=temp2->ptr;
}
traverse(head1);