QueuUsingLinkLIst

/*This Flie is Made by VISHESH YADAV (ECE-1) Netaji Subhas University Of technology*/


#include <stdio.h>
#include <stdlib.h>
 typedef struct node{
    int data;
struct node* next;
 }node;
 node*rear=NULL;
 node * front =NULL;
 node*temp=NULL;

 void enqueu (int val){
temp = (node*)malloc(sizeof(node));
temp->data = val;
temp->next=NULL;
if(front==NULL && rear==NULL){
    front =rear=temp;
    return;
}
rear->next=temp;
rear=temp;

}

void dequeu(){
    node*temp =front;
    int ans = front->data;
    if(front==NULL){
        return;
    }
    if(front==rear){
        front=rear=NULL;
    }
    else{
        front=front->next;
    }
    printf("%d element removed\n",ans);

    free(temp);
}

void display(){
    node*p=front;
    while(p!=rear){
        printf("%d->",p->data);
        p=p->next;
    }
    printf("%d",rear->data);
}

int main(){
    int val,ch;
    while(1){
        printf("\n1.Insert\n2.remove\n3.Display\n");
        scanf("%d",&ch);
        switch(ch){
            case 1 : {
                printf("Enter element to insert:");
                scanf("%d",&val);
                enqueu(val);
                break;
            }
            case 2 :{
                dequeu();
                break;
            }
            case 3: {
                
                display();
                break;
            }
            default: printf("wrong choice\n");
        }
    }
}