/*PROGRAM TO DELETE AN ELEMENT FROM SORTED SINGULAR LINKED LIST*/
#include<conio.h>
#include<iostream.h>
struct node
{
int data;
struct node *link;
};
void main()
{
struct node *start=NULL,*ptr,*temp,*ptr1,*ptr2;
int num,n;
char ch;
clrscr();
cout<<“Inserting elements in the list:”<<endl;
do
{
temp=new node;
cout<<“Enter element: “;
cin>>num;
temp->data=num;
if(start==NULL||start->data>=temp->data)
{
temp->link=start;
start=temp;
}
else
{
ptr1=start;
ptr2=start->link;
while(ptr2!=NULL&&ptr2->data<=temp->data)
{
ptr1=ptr2;
ptr2=ptr2->link;
}
temp->link=ptr1->link;
ptr1->link=temp;
}
cout<<“Do you want to continue?? “;
cin>>ch;
}while(ch==’y’||ch==’Y’);
cout<<“Elements of list are”<<endl;
for(ptr=start;ptr!=NULL;ptr=ptr->link)
{
cout<<ptr->data<<“\t”;
}
cout<<endl<<“Do you want to perform deletion?? “;
cin>>ch;
if(ch==’y’||ch==’Y’)
{
do
{
cout<<“Enter your choice:”<<endl;
cout<<“Deletion from begining — 1″<<endl;
cout<<“Deletion from end — 2″<<endl;
cin>>n;
switch(n)
{
case 1:
cout<<“Deleted node is: “<<start->data<<endl;
start=start->link;
break;
case 2:
ptr1=start;
ptr2=start->link;
while(ptr2->link!=NULL)
{
ptr1=ptr2;
ptr2=ptr2->link;
}
if(ptr2!=NULL)
{
cout<<“Deleted element is: “<<ptr2->data<<endl;
ptr1->link=NULL;
}
else
{
cout<<“Deleted node is: “<<ptr1->data<<endl;
start=NULL;
}
break;
default:
cout<<“wrong choice”<<endl;
}
if(start!=NULL)
{
cout<<“Remaining elements in the list are:”<<endl;
for(ptr=start;ptr!=NULL;ptr=ptr->link)
{
cout<<ptr->data<<“\t”;
}
}
else
{
cout<<“!!List is empty now!!”;
break;
}
cout<<endl<<“Do you want to continue?? “;
cin>>ch;
}while(ch==’y’||ch==’Y’);
if(start!=NULL)
{
cout<<“Remaining elements in the list are: “<<endl;
for(ptr=start;ptr!=NULL;ptr=ptr->link)
{
cout<<ptr->data<<“\t”;
}
}
}
else
cout<<“!!Press any key to exit!!”;
getch();
}