/*❗❗RUN IT IN PC AS SOLOLEARN HANDLE INPUTS IN DIFFERENT MANNER*❗❗*/ #include using namespace std; struct node { int value; struct node *next; }; class list { private: struct node *head; int n; public: list() { head=NULL; n=0; } void insertbeg(); void insertend(); void insertpos(); void delbeg(); void delend(); void delpos(); void display(); }; void list:: insertbeg() { struct node *temp; temp = new node; cout<<"ENTER THE VALUE TO INSERT AT BEGINING"<>temp->value; temp->next=NULL; if(head==NULL) { head=temp; n++; cout<<"LIST IS EMPTY SO INSERTING"<value<<"IN BEGINING"<next=head; head=temp; n++; cout<value; } void list::insertend() { struct node *temp,*c; temp = new node; cout<<"ENTER THE VALUE TO INSERT AT END"<>temp->value; temp->next=NULL; if(head==NULL) { head=temp; n++; return; } for(c=head;c->next!=NULL;c=c->next); c->next=temp; } void list::insertpos() { struct node *temp,*c; int pos; cout<<"ENTER THE POSITION"<>pos; if(pos<=0&&pos>n+1) { cout<<"INVALID POSITION"<n+1) { insertend(); return ; } temp = new node; c= new node; cout<<"ENTER THE VALUE TO INSERT AT position"<>temp->value; temp->next=NULL; int i; for( i=1,c=head;inext,i++); temp->next=c->next; c->next=temp; } void list::display() { node *temp=new node; temp=head; for(temp=head;temp!=NULL;temp=temp->next) { cout<<"["<value<<"]"<<"->"; } } void list::delbeg() { struct node * temp; temp = new node; if(head==NULL) { cout<<"LIST EMPTY"<value<<"IS DELETED"<next; delete temp; n--; } void list::delend() { struct node *c,*p; if(head==NULL) { cout<<"EMPTY LIST"; return ; } for(p=head,c=head;c->next!=NULL;p=c,c=c->next); p->next=NULL; cout<value<<""<<"IS DELETED"<>pos; if(pos<=0||pos>n) { cout<<"INVALID"<next); cout<value<<"IS DELETED FROM END"<next=c->next; n--; delete c; } int main() { list obj; int ch; int c; do { cout<<"Enter 1.Insert beg"<<"\n"<<"2.Insert pos"<<"\n"<<"3.Insert end"<<"\n"<<" 4.Del beg"<<"\n"<<" 5.Del end"<<"\n"<<" 6.Del pos"<<"\n"<<"7.Display"<>ch; switch(ch) { case 1: { obj.insertbeg(); break; } case 2: { obj.insertpos(); break; } case 3: { obj.insertend(); break; } case 4: { obj.delbeg(); break; } case 5: { obj.delend(); break; } case 6: { obj.delpos(); break; } case 7: { obj.display(); break; } default: { cout<<"Invalid choice"<>c; }while(c==1); return 0; }

Linked list-Single