Program to create Queue implementation through Linked List in C.

#include
#include
struct node
{
int data;
struct node  *link;
};
struct node *front, *rear;
void main()
{

int wish,will,a,num;
void add(int);

wish=1;
clrscr();
front=rear=NULL;

printf("Program to create Queue implementation through Linked List in C.");
while(wish == 1)
 {
 printf("Main Menu
1.Enter data in queue 
2.Delete from queue
");
 scanf("%d",&will);
 switch(will)
  {
  case 1:
   printf("Enter the Numbers");
   scanf("%d",&num);
   add(num);
   //display();
   break;
  case 2:
   a=del();
   printf("Value returned from front of the queue is %d",a);
   break;
  default:
   printf("Invalid choice");
  }
 printf("Do you want to continue, press 1");
 scanf("%d",&wish);
 }
getch();
}

void add(int y)
{
struct node *ptr;
ptr=malloc(sizeof(struct node));
ptr->data=y;
ptr->link=NULL;
if(front ==NULL)
 {
 front = rear= ptr;
 }
else
 {
 rear->link=ptr;
 rear=ptr;
 }
}


int  del()
{
int num;
if(front==NULL)
 {
 printf("QUEUE EMPTY");
 return(0);
 }
else
 {
 num=front->data;
 front = front->link;
 printf(" Value returned by delete function is %d ",num);
 return(num);
 }
}

Related Links :