queue using linklist.c

     #include<stdio.h>
  #include<stdlib.h>
  using namespace std;

  struct node
  {
    int data;
    node *next;
  };

  node *front = NULL;
  node *rear =NULL;


  node *creation(int data)
  {
    node *tmp=(struct node *)malloc(sizeof(struct node));
    tmp->data = data;
    tmp->next=NULL;
    return tmp;
  }




 void insertion(int item)
 {
       node *newnode = creation(item);

       if(front==NULL)
       {
          front = rear = newnode;
       }

       else
       {
          rear->next = newnode;
          rear = newnode;
       }
  }





void deletion()
{
   struct node *temp;

   if (front == NULL)
   {
     printf("\nQueue is Empty \n");
     return;
   }

   else
   {
       temp = front;
       front = front->next;
       if(front == NULL)  rear = NULL;
       free(temp);
   }
 }


void display()
{
    node *temp=front;

    if(front == NULL)
    {
      printf("Queue is Overflow\n");
    }

    else
    {
        printf("Queue is :\n");
        while(temp != NULL)
        {
            printf("%d ",temp->data);
            temp = temp->next;
        }
    }
    printf("\n");
}



   int main()
    {
      int choice, item;

      while(1)
      {
        printf("1.Insert\n");
        printf("2.Delete\n");
        printf("3.Display\n");
        printf("4.Quit\n");
        printf("Enter your choice : ");
        scanf("%d", &choice);

        if(choice==1)
        {
           scanf("%d", &item);
           insertion(item);
        }
        else if(choice==2)  deletion();
        else if(choice==3)  display();
        else     printf("Wrong type \n");
     }

     return 0;
   }