Linked list Programming exercises in Data structure

Example :1
Make Menu and perform the following operation by the help of singly linked list?
Create a link list. (The list should be Dynamic and should stop only when the user wishes to end the creation of the list).

• Ask User to enter  a  desire  node and  as a result the program will delete that node from the list.
• Take a node from the user as input and insert that node after the desired node provided by the user.
• Take an identification of a node as input  from the user and search that node from the created link list.

Source Code:

#include "stdafx.h" #include<iostream> #include<conio.h> #include<stdlib.h> using namespace std; class list { struct node { int data; node *link; }*p; public: void inslast(int); void insbeg(int); void insnext(int,int); void delelement(int); void delbeg(); void dellast(); void disp(); int seek(int); list(){p=NULL;} ~list(); }; void list::inslast(int x) { node *q,*t; if(p==NULL) { p=new node; p->data=x; p->link=NULL; } else { q=p; while(q->link!=NULL) q=q->link; t=new node; t->data=x; t->link=NULL; q->link=t; } cout<<"Inserted successfully at the end.."; disp(); } void list:: insbeg(int x) { node *q; q=p; p=new node; p->data=x; p->link=q; cout<<" Inserted successfully at the begining.."; disp(); } void list::delelement(int x) { node *q,*r; q=p; if(q->data==x) { p=q->link; delete q; return; } r=q; while(q!=NULL) { if(q->data==x) { r->link=q->link; delete q; return; } r=q; q=q->link; } cout<<"Element u entered "<<x<<" is not found.."; } void list:: delbeg() { cout<<"The list before deletion:"; disp(); node *q; q=p; if(q==NULL) { cout<<"No data is present.."; return; } p=q->link; delete q; return; } void list:: dellast() { cout<<"The list before deletion:"; disp(); node *q,*t; q=p; if(q==NULL) { cout<<" There is no data in the list.."; return; } if(q->link==NULL) { p=q->link; delete q; return; } while(q->link->link!=NULL) q=q->link; q->link=NULL; return; } list::~list() { node *q; if(p==NULL) return; while(p!=NULL) { q=p->link; delete p; p=q; } } void list::disp() { node *q; q=p; if(q==NULL) { cout<<"No data is in the list.."; return; } cout<<"The items present in the list are :"; while(q!=NULL) { cout<<" "<<q->data; q=q->link; } } void list :: insnext(int value,int position) { node *temp,*temp1; temp=p; temp1=temp->link; if(temp1==NULL) { temp1= new node; temp1->data=value; temp1->link=NULL; p=temp1; return; } for(int i=0;((i<position)&&(temp->link!=NULL)) ;i++) { if(i==(position-1)) { temp1= new node; temp1->data= value; temp1->link=temp->link; temp->link=temp1; } temp=temp->link; } cout<<"Inserted successfully at the position.."<<position; disp(); } int list::seek(int value) { node *temp; temp=p; int position=0; while(temp!=NULL) { if(temp->data==value) return position+1; else { temp=temp->link; position=position+1; } } cout<<" Element "<<value<<" not found"; return 0; } void main() { system("color f5"); list l; int ch,v,p,ps,n; do { cout<<endl; cout<<"Operations on List"<<endl; cout<<"1.Insertion 2.Deletion 3.Display 4.Seek 5.Exit"<<endl; cout<<"Enter ur choice:"; cin>>ch; switch(ch) { case 1: cout<<"1.Insertion at begining 2"<<endl; cout<<"2.Insertion at the end"<<endl; cout<<"3.Insertion after the mentioned position"<<endl; cout<<"Enter ur choice:"<<endl; cin>>ps; cout<<"Enter the value to insert"<<endl; cin>>v; switch(ps) { case 1: l.insbeg(v); break; case 2: l.inslast(v); break; case 3: cout<<"Enter the position to insert the value:"<<endl; cin>>p; if(p==0) { l.insbeg (v); } else { l.insnext(v,p); } break; case 4: cout<<"Enter the position to insert the value:"<<endl; cin>>n; l.insprev (v,n); break; default: cout<<"The choice is invalid"<<endl; return; } break; case 2: cout<<"1.Delete the first element"<<endl; cout<<"2.Delete the last element"<<endl; cout<<"3.Enter the element to delete from the list"<<endl; cout<<" Enter ur choice:"<<endl; cin>>ps; switch(ps) { case 1: l.delbeg(); cout<<"The list after deletion:"<<endl;l.disp(); break; case 2: l.dellast(); cout<<"The list after deletion:"<<endl;l.disp(); break; case 3: l.disp(); cout<<"Enter the element to delete from the list"<<endl; cin>>v; l.delelement(v); cout<<"The list after deletion:"<<endl;l.disp(); break; default: cout<<"The option is invalid..."<<endl; break; } break; case 3: l.disp(); break; case 4: l.disp(); cout<<" Enter the element to search:"<<endl; cin>>v; cout<<"The position of the element "<< v<<" is "<<l.seek(v)<<endl; getch(); break; case 5: exit(1); default: cout<<"The option is invalid..."; return; } getch(); } while(ch!=5); getch(); return; }

 Example :2
Make a Menu and perform the following operation using doubly linked list?

• Create a doubly link list. (The list should be Dynamic and should stop only when the user wishes to end the creation of the list).The list can be created either in forward or backward manner.
• Provide the option to the user for the deletion of the node (before the current node or after the current node).Take an identification of a node from the user and delete that node from the list.
• (a)Take a node from the user and insert that node after the desired node provided by the user.(b) take a node from the user and insert that node before the desired node provided by the user.                        
• Take an identification of a node from the user and search that node from the created doubly link list. The node can be searched by traversing the doubly link list either in forward or in backward manner.

 Source Code:

#include "stdafx.h" #include<iostream> #include<conio.h> #include<stdlib.h> using namespace std; class list { struct node { int data; node *link; }*p; public: void inslast(int); void insbeg(int); void insnext(int,int); void insnext1(int,int); void insprev(int,int); void delelement(int); void deletebefore(); void deleteafter(); void delbeg(); void dellast(); void disp(); void disp1(int); void disp2(int); int seek(int); list(){p=NULL;} ~list(); }; void list::inslast(int x) { node *q,*t; if(p==NULL) { p=new node; p->data=x; p->link=NULL; } else { q=p; while(q->link!=NULL) q=q->link; t=new node; t->data=x; t->link=NULL; q->link=t; } } void list:: insbeg(int x) { node *q; q=p; p=new node; p->data=x; p->link=q; } void list::delelement(int x) { node *q,*r; q=p; if(q->data==x) { p=q->link; delete q; return; } r=q; while(q!=NULL) { if(q->data==x) { r->link=q->link; delete q; return; } r=q; q=q->link; } cout<<"Element u entered "<<x<<" is not found.."; } void list:: delbeg() { node *q; q=p; if(q==NULL) { cout<<"No data is present.."; return; } p=q->link; delete q; return; } void list:: dellast() { node *q; q=p; if(q==NULL) { cout<<" There is no data in the list.."; return; } if(q->link==NULL) { p=q->link; delete q; return; } while(q->link->link!=NULL) q=q->link; q->link=NULL; return; } list::~list() { node *q; if(p==NULL) return; while(p!=NULL) { q=p->link; delete p; p=q; } } void list::disp() { node *q; q=p; if(q==NULL) { cout<<"No data is in the list.."<<endl; return; } cout<<"The items present in the list are"<<endl; while(q!=NULL) { cout<<q->data<<"\t"; q=q->link; } cout<<endl<<endl; } void list::deleteafter() { int x; cout<<"Enter The Value Which You Want delete after"<<endl; cin>>x; node *t; t=p;int z=0;int f=0; while(t!=NULL) { if(t->data ==x) { if(t->link ==NULL) { f=1; } else { f=2; break; } } t=t->link ; z=z+1; } switch(f) { case 0: cout<<"!Error!....Your Value Is not Found"<<endl; break; case 1: cout<<"!Error!......"<<endl; break; case 2: int n; node *q; q=p; if(q==NULL) { cout<<"No data is in the list.."; } while(q!=NULL) { if(q->data ==x) { q=q->link ; n=q->data; break; } q=q->link; } delelement(n); break; } } void list::deletebefore() { int x,a; cout<<"Enter The Value Which You Want delete before"<<endl; cin>>x; node *t; t=p;int z=0;int f=0; while(t!=NULL) { if(t->data ==x) { f=1; break; } t=t->link ; z=z+1; } switch(f){ case 0: cout<<"!Error!....Your Value Is not Found"<<endl; break; case 1: z=z-1; if(z<0) { cout<<"!Error!....."<<endl; } else { node *q; q=p; if(q==NULL) { cout<<"No data is in the list.."; } while(q!=NULL) { if(q->data ==x) { break; } a=q->data ; q=q->link; } delelement(a); } break; } } void list :: insnext(int value,int position) { node *t; t=p;int z=0; while(t!=NULL) { t=t->link ; z=z+1; } if(position>z) {cout<<"!Error! .... Your Position is Wrong"<<endl; } else { node *temp,*temp1; temp=p; temp1=temp->link; if(temp1==NULL) { temp1= new node; temp1->data=value; temp1->link=NULL; p=temp1; return; } for(int i=0;((i<position)&&(temp->link!=NULL)) ;i++) { if(i==(position-1)) { temp1= new node; temp1->data= value; temp1->link=temp->link; temp->link=temp1; } temp=temp->link; } }} void list :: insnext1(int value,int position) { node *t; t=p;int z=0; while(t!=NULL) { t=t->link ; z=z+1; } if(position=z) { cout<<"!Error! .... Your Position is Wrong"<<endl; } else { node *temp,*temp1; temp=p; temp1=temp->link; if(temp1==NULL) { temp1= new node; temp1->data=value; temp1->link=NULL; p=temp1; return; } for(int i=0;((i<position)&&(temp->link!=NULL)) ;i++) { if(i==(position-1)) { temp1= new node; temp1->data= value; temp1->link=temp->link; temp->link=temp1; } temp=temp->link; } }} void list::disp1(int x) { node *q; q=p; if(q==NULL) { cout<<"No data is in the list.."<<endl; return; } node *t; t=p;int z=0;int k=0; while(t!=NULL) { if(t->data ==x) { k=1; break; } t=t->link ; z=z+1; } switch (k) { case 0: cout<<"!Error! .... Your Element is not on the List"<<endl<<endl; break; case 1: cout<<"The items present in Backward list are"<<endl; for(int i=z;i>0;i--) { cout<<q->data<<"\t"; q=q->link; } cout<<endl<<endl; break; } } void list::disp2(int x) { node *t1; t1=p;int z1=0; while(t1!=NULL) { t1=t1->link ; z1=z1+1; } node *q; q=p; if(q==NULL) { cout<<"No data is in the list.."<<endl; return; } node *t; t=p;int z=0;int k=0; while(t!=NULL) { if(t->data ==x) { k=1; break; } t=t->link ; z=z+1; } switch (k) { case 0: cout<<"!Error! .... Your Element is not on the List"<<endl<<endl; break; case 1: cout<<"The items present in Backward list are"<<endl; while(q!=NULL) { if(q->data ==x) { q=q->link ; cout<<q->data<<"\t" ; x=q->data ; if (q->link ==NULL) { break; } } else { q=q->link ; } } cout<<endl<<endl; break; } } int _tmain(int argc, _TCHAR* argv[]) { list l; menue: system("cls"); cout<<"\t\t\t::::::::::::::::::::::::::::::::::::"<<endl; cout<<"\t\t\t Doubly linked lists "<<endl; cout<<"\t\t\t::::::::::::::::::::::::::::::::::::"<<endl<<endl; cout<<"Press 1 for Inserting Element"<<endl; cout<<"Press 2 for Deleteing Element"<<endl; cout<<"Press 3 for Display Elements"<<endl; cout<<"Press 4 for Exit"<<endl; int a; cout<<endl; cout<<"[ ]\b\b"; cin>>a; switch(a){ case 1: manue1: system("cls"); cout<<"\t\t\t::::::::::::::::::::::::::::::::::::"<<endl; cout<<"\t\t\t WELOCOME TO INSERT FUNCTION "<<endl; cout<<"\t\t\t::::::::::::::::::::::::::::::::::::"<<endl<<endl; cout<<endl; cout<<"Press 1 for Inserting Element At Begain Position"<<endl; cout<<"Press 2 for Inserting Element At Last Position "<<endl; cout<<"Press 3 for Inserting Elements Before Mentional Position "<<endl; cout<<"Press 4 for Inserting Elements After Mentional Position "<<endl; cout<<"Press 5 for Main Manue"<<endl; cout<<"Press 6 for Exit"<<endl; int b; cout<<endl; cout<<"[ ]\b\b"; cin>>b; switch(b){ case 1: cout<<endl; cout<<"Enter The Element"<<endl; int c; cin>>c; l.insbeg (c); cout<<endl; l.disp (); cout<<endl; cout<<"Press 1 for IsertingManue"<<endl; cout<<"Press 2 for Main Manue"<<endl; cout<<"Press 3 for Exit"<<endl; int d; cout<<endl; cout<<"[ ]\b\b"; cin>>d; switch(d){ case 1: goto manue1; break; case 2: goto menue; break; } break; case 2: cout<<endl; cout<<"Enter The Element"<<endl; int e; cin>>e; l.inslast (e); cout<<endl; l.disp (); cout<<endl; cout<<"Press 1 for IsertingManue"<<endl; cout<<"Press 2 for Main Manue"<<endl; cout<<"Press 3 for Exit"<<endl; int f; cout<<endl; cout<<"[ ]\b\b"; cin>>f; switch(f){ case 1: goto manue1; break; case 2: goto menue; break; } break; case 3: cout<<endl; cout<<"Enter The Element which Your Want to insert"<<endl; int g,h; cin>>g; cout<<endl; l.disp (); cout<<endl; cout<<"Enter The position which Your Want to insert Element Befor That Position"<<endl; cin>>h; h=h-1; if(h==0) { l.insbeg (g); } if(h<0) { cout<<"!Error! .... Your mentional Position Is Wrong"<<endl; } if(h>=1) { l.insnext (g,h); } cout<<endl; l.disp (); cout<<endl; cout<<"Press 1 for IsertingManue"<<endl; cout<<"Press 2 for Main Manue"<<endl; cout<<"Press 3 for Exit"<<endl; int i; cout<<endl; cout<<"[ ]\b\b"; cin>>i; switch(i){ case 1: goto manue1; break; case 2: goto menue; break; } break; case 4: cout<<endl; cout<<"Enter The Element which Your Want to insert"<<endl; int j,k; cin>>j; cout<<endl; l.disp (); cout<<endl; cout<<"Enter The position which Your Want to insert Element After That Position"<<endl; cin>>k; k=k+1; if(k<=0) { cout<<"!Error! .... Your mentional Position Is Wrong"<<endl; } else { l.insnext1 (j,k); } cout<<endl; l.disp (); cout<<endl; cout<<"Press 1 for IsertingManue"<<endl; cout<<"Press 2 for Main Manue"<<endl; cout<<"Press 3 for Exit"<<endl; int m; cout<<endl; cout<<"[ ]\b\b"; cin>>m; switch(m){ case 1: goto manue1; break; case 2: goto menue; break; } break; case 5: goto menue; break; } break; case 2: manue2: system("cls"); cout<<"\t\t\t::::::::::::::::::::::::::::::::::::"<<endl; cout<<"\t\t\t WELOCOME TO DELETE FUNCTION "<<endl; cout<<"\t\t\t::::::::::::::::::::::::::::::::::::"<<endl<<endl; cout<<endl; cout<<"Press 1 for Delete Element At Begain Position"<<endl; cout<<"Press 2 for Delete Element At Last Position "<<endl; cout<<"Press 3 for Delete Elements Before Mentional Position "<<endl; cout<<"Press 4 for Delete Elements After Mentional Position "<<endl; cout<<"Press 5 for Main Manue"<<endl; cout<<"Press 6 for Exit"<<endl; cout<<endl; int n; cout<<endl; cout<<"[ ]\b\b"; cin>>n; switch(n){ case 1: cout<<endl; cout<<"Befor Deleting"<<endl; l.disp (); cout<<endl; l.delbeg (); cout<<"After Deleting"<<endl; cout<<endl; l.disp (); cout<<endl; cout<<"Press 1 for Delete Manue"<<endl; cout<<"Press 2 for Main Manue"<<endl; cout<<"Press 3 for Exit"<<endl; int o; cout<<endl; cout<<"[ ]\b\b"; cin>>o; switch(o){ case 1: goto manue2; break; case 2: goto menue; break; } break; case 2: cout<<endl; cout<<"Befor Deleting"<<endl; l.disp(); l.dellast (); cout<<endl; cout<<"After Deleting"<<endl; cout<<endl; l.disp (); cout<<endl; cout<<"Press 1 for Delete Manue"<<endl; cout<<"Press 2 for Main Manue"<<endl; cout<<"Press 3 for Exit"<<endl; int p; cout<<endl; cout<<"[ ]\b\b"; cin>>p; switch(p){ case 1: goto manue2; break; case 2: goto menue; break; } break; case 3: cout<<endl; cout<<"Yout List Befor Deleting"<<endl; l.disp (); cout<<endl; l.deletebefore (); cout<<endl; l.disp (); cout<<endl; cout<<"Press 1 for Delete Manue"<<endl; cout<<"Press 2 for Main Manue"<<endl; cout<<"Press 3 for Exit"<<endl; int q; cout<<endl; cout<<"[ ]\b\b"; cin>>q; switch(q){ case 1: goto manue2; break; case 2: goto menue; break; } break; case 4: cout<<endl; cout<<endl; cout<<"Yout List Befor Deleting"<<endl; l.disp (); cout<<endl; l.deleteafter (); cout<<endl; l.disp (); cout<<endl; cout<<"Press 1 for Delete Manue"<<endl; cout<<"Press 2 for Main Manue"<<endl; cout<<"Press 3 for Exit"<<endl; int r; cout<<endl; cout<<"[ ]\b\b"; cin>>r; switch(r){ case 1: goto manue2; break; case 2: goto menue; break; } break; case 5: goto menue; break; } break; case 3: manue4: system("cls"); cout<<"\t\t\t::::::::::::::::::::::::::::::::::::"<<endl; cout<<"\t\t\t WELOCOME TO DISPLAY FUNCTION "<<endl; cout<<"\t\t\t::::::::::::::::::::::::::::::::::::"<<endl<<endl; cout<<endl; cout<<"Press 1 for Backward Display"<<endl; cout<<"Press 2 for Forward Display"<<endl; cout<<"Press 3 for Main Manue"<<endl; cout<<"Press 4 for Exit"<<endl; cout<<endl; int u; cout<<"[ ]\b\b"; cin>>u; switch(u){ case 1: cout<<endl; l.disp (); cout<<endl; cout<<"Enter The Element For Backward Display"; cout<<endl; int t; cin>>t; l.disp1 (t); cout<<"Press 1 for Display Manue"<<endl; cout<<"Press 2 for Main Manue"<<endl; cout<<"Press 3 for Exit"<<endl; int s; cout<<endl; cout<<"[ ]\b\b"; cin>>s; switch(s){ case 1: goto manue4; break; case 2: goto menue; break; } break; case 2: cout<<endl; l.disp (); cout<<endl; cout<<"Enter The Element For Forward Display"; cout<<endl; int u1; cin>>u1; l.disp2 (u1); cout<<"Press 1 for Display Manue"<<endl; cout<<"Press 2 for Main Manue"<<endl; cout<<"Press 3 for Exit"<<endl; int s1; cout<<endl; cout<<"[ ]\b\b"; cin>>s1; switch(s1){ case 1: goto manue4; break; case 2: goto menue; break; } break; case 3: goto menue; break; } } return 0; }