# include struct node { int info; struct node* link; }; int main() { int ch,data; struct node *front=NULL,*rear=NULL,*sap,*ptr,*newptr; char ans; do { printf("n 1. insert n delete n 3.display 4.exit"); printf("enter your choice"); scanf("%d",&ch;); switch(ch) { case 1: { newptr=(struct node*) malloc(sizeof(struct node)); if(newptr==NULL) { printf("n no memory"); return 0; } printf("n enter tye elements"); scanf("%d",&data;); newptr->info=data; newptr->link=data; if(rear==NULL) front=rear=newptr; else { rear->link=newptr; rear=newptr; } break; } case 2: printf("do u wanna delete"); scanf("%c",&ans;); while(ans=='y'||ans=='Y')