#include using namespace std; struct node { int data; struct node *next; }*head; class Sll { public: int n; struct node * createnode(); void accept(); void display(); void insatbeg(); void insafter(); void insatend(); void delatbeg(); void delafter(); void delatend(); void search(); void update(); void revert(); }; struct node * Sll::createnode() { struct node *newNode=new(node); cout<<"\nEnter Data\n"; cin>>newNode->data; newNode->next=NULL; return(newNode); } void Sll:: accept() { struct node *newNode,*temp; head=NULL; cout<<"\nEnter How Many Nodes You Want Accept"; cin>>n; for(int i=0;inext!=NULL) { temp=temp->next; } temp->next=newNode; } } } void Sll::display() { struct node *temp; temp=head; while(temp!=NULL) { cout<<"\t"<data; temp=temp->next; } } void Sll::insatbeg() { struct node *newNode=createnode(); newNode->next=head; head=newNode; display(); } void Sll::insafter() { int n; cout<<"\nAfter Which Node u Want To Insert \n"; cin>>n; struct node *newNode=createnode(); struct node *temp,*temp1; temp=head; while(temp->data!=n) { temp=temp->next; } temp1=temp->next; temp->next=newNode; newNode->next=temp1; display(); } void Sll::insatend() { struct node *newNode=createnode(); struct node *temp; temp=head; while(temp->next!=NULL) { temp=temp->next; } temp->next=newNode; newNode->next=NULL; display(); } void Sll::delatbeg() { struct node *temp; temp=head; head=head->next; temp->next=NULL; delete(temp); cout<<"\nItem Deleted Successfully\n"; display(); } void Sll::delafter() { int n; cout<<"\nAfter Which Element U Want To Delete\n"; cin>>n; struct node *temp,*temp1,*temp2; temp=head; while(temp->data!=n) { temp=temp->next; } temp1=temp->next; temp2=temp1->next; //temp1->next=NULL; temp->next=temp2; delete(temp1); cout<<"\nItem Deleted Successfully\n"; display(); } void Sll::delatend() { struct node *temp,*old; temp=head; old=temp; while(temp->next!=NULL) { old=temp; temp=temp->next; } old->next=NULL; delete(temp); cout<<"\nItem deleted successfully\n "; display(); } void Sll::search() { int n,flag; flag=0; cout<<"\nEnter Element U want To Search\n"; cin>>n; struct node *temp; temp=head; while(temp->next!=NULL) { if(temp->data==n) { flag=1; break; } else { temp=temp->next; } } if(flag==1) { cout<<"\nElement Found\n"; } else { cout<<"\nNot Found\n"; } } void Sll::update() { int n,flag; flag=0; cout<<"\nEnter Element U want To Update\n"; cin>>n; struct node *temp; temp=head; while(temp->next!=NULL) { if(temp->data==n) { cout<<"\nEnter New Element\n"; cin>>temp->data; flag=1; break; } else { temp=temp->next; } } if(flag==1) { cout<<"\nUpdate Successfully\n"; } else { cout<<"\nNot Found So Not Updated\n"; } display(); } void Sll::revert() { struct node *old,*temp,*oldold; temp=head; while(temp!=NULL) { oldold=old; old=temp; temp=temp->next; old->next=oldold; } head->next=NULL; head=old; cout<<"\nRevert Element are \n"; display(); } int main() { Sll obj; cout<<"\nFirst Enter Link List\n"; obj.accept(); obj.display(); char a; int ch; do { cout<<"\nMenu \n1.Insert At Begenning\n2.Insert After \n3.Insert At End\n4.Delete At Begenning\n5.Delete After\n6.Delete At End\n7.Search\n8.Update\n9.Revert\n"; cout<<"Enter Your Choice "; cin>>ch; switch(ch) { case 1: obj.insatbeg(); break; case 2: obj.insafter(); break; case 3: obj.insatend(); break; case 4: obj.delatbeg(); break; case 5: obj.delafter(); break; case 6: obj.delatend(); break; case 7: obj.search(); break; case 8: obj.update(); break; case 9: obj.revert(); break; } cout<<"\nDo U Want To continue \n"; cin>>a; } while(a=='y'||a=='Y'); return 0; }

Singly Link-List