Queue-Linked List

#include<bits/stdc++.h>
using namespace std;


struct Node
{
   int data;
   struct Node *next;
}*front=NULL,*rear=NULL;

void enqueue(int x)
{
      struct Node *t;
      t=(struct Node*)malloc(sizeof(struct Node));
      if(t==NULL)
          printf("Queue is FULL\n");
      else
      {
          t->data=x;
          t->next=NULL;
          if(front=NULL)            //if first element of the queue
              front=rear=t;
        else
        {
             rear->next=t;
             rear=t;
        }     
      }
}      
int dequeue()
{
      int x=-1;struct NOde *t;
      if(front==NULL)
         cout<<"Stack is empty";
      else
        {
          x=front->data;
          t=front
          front=front->next;
          free(t);
        }
        return x;
}

void Display()
{     
     struct Node *p;
     while(p)
     { 
         printf("%d",p->data);
         p=p->next;
     }    
         
  }   
int main()
{ 
    enqueue(10);
    Display();
    dequeue();
   return 0;
}