#include #include using namespace std; struct linklist { //parts of a node. int data; linklist*link; linklist() { link=NULL; } }; class nodes { //pointers to handle the linklist linklist *start,*cur,*temp; public: nodes() { start=NULL; } //function to create nodes creat_node (int n) { //create 1st node... if(start==NULL) { start=new linklist; start->link=NULL; start->data=n; } //to create new node.. else { cur=start; while(cur->link!=NULL) { cur=cur->link; } temp=new linklist; temp->data=n; temp->link=NULL; cur->link=temp; } } //deletion void deletion(int d) { cur=start; if(start->data==d) { temp=start; start=start->link; delete temp; } else { while(cur->data!=d) { if(cur->link==NULL) { cout<<"Data does not exist"<link; } temp->link=cur->link; delete cur; } } //insertion void insert(int p,int d) { cur=start; //insert data at start if(p==1) { temp=new linklist; temp->data=d; temp->link=start; start=temp; } //insert data in mid or at end else { for(int i=1;ilink; } temp=new linklist; temp->data=d; temp->link=cur->link; cur->link=temp; } } //sorting data sorting() { cur=temp=start; linklist*add; int t; while(cur->link!=NULL)//outer loop { temp=cur; while(temp->link!=NULL)//inner loop { if(cur->data>=temp->data) { t=cur->data; cur->data=temp->data; temp->data=t; } temp=temp->link; } //used this if to compare data of last node if(cur->data>=temp->data) { t=cur->data; cur->data=temp->data; temp->data=t; } cur=cur->link; } } void search(int s) { cur=start; while(cur->data!=s) { if(cur->link==NULL) { cout<<"data not found"<link; } cout<<"\n\tData found "<>n; if(n==1) { cout<<"Enter new value"<>cur->data; cout<<"\n\tData updated"<link!=NULL;c++) { cout<<"Data "< "<data<link; } cout<<"Data "< "<data<>noofnodes; //create nodes....function call pass data.. for(i=1;i<=noofnodes;i++) { cout<<"Enter data\t"; cin>>n; l1.creat_node(n); } do { cout<<"\n==============================================\n"<>ch; switch(ch) { case 1: cout<<"Enter Data"<>n; cout<<"\nWhere you want to insert New Data...\n"<>p; l1.insert(p,n); l1.print(); break; case 2: cout<<"\nEnter Data you want to delete\n\n"<>n; l1.deletion(n); cout<<"\nData "<>n; l1.search(n); l1.print(); case 5: l1.print(); break; default: cout<<"\t----------Invalid----------"<