#include #include using namespace std; struct node { int val; node *link; }; node* InsAtBeg(node *temp,int num) { node *newnode = new node(); newnode->val=num; newnode->link= temp; return newnode; } node* InsAtEnd(node *temp,int num) { node*temp1; temp1=temp; node *newnode = new node(); newnode->val=num; newnode->link=NULL; if(temp==NULL) { cout<<"List is empty"; temp=newnode; return temp; } else { while(temp->link!=NULL) { temp=temp->link; } temp->link=newnode; return temp1; } } void traverse(node *temp) { if(temp==NULL) cout<<"Empty List"<val<link; } } } node* deletefrombeg(node *temp,int num) { node *temp1; temp1=temp; temp=temp->link; delete(temp1); return temp; } node* deletefromend(node *temp,int num){ node *temp1; node *temp2; temp1=temp; temp2=temp; if(temp==NULL) { cout<<"List is empty"; return NULL; } else { if(temp->link==NULL) { cout<<"the list have only one node"; delete(temp); return NULL; } else { while(temp->link!=NULL) { temp1=temp; temp=temp->link; } temp1->link=NULL; delete (temp); return temp2; } } } int main() { node *start=NULL; char ch,ch2='y'; int num,num2; while(ch2=='y') { cout<<"Your option"<>ch; switch(ch) { case 'i': { cout<<" Enter your choice"<>ch; switch(ch) { case 'b': { cout<<"Enter the value to be Inserted"<>num; start=InsAtBeg(start,num); break; } case 'e': { cout<<"Enter the value to be Inserted"<>num; cout<<"Inserted at the end"<>ch; switch(ch) { case 'b': { cout<<"Enter the value to be Deleted"<>num; cout<<"Deleted at the beginning"<>num; cout<<"Deleted at the end"<>ch2; } }

mylinklist.cpp