#include <stdio.h>
#include<stdlib.h>
struct node
{
    int data;
    struct node*next;
};
struct node*front=0;
struct node*rear=0;
void enqueue(int x)
{  
    struct node*newnode;
    newnode=(struct node*)malloc(sizeof(struct node));
    newnode->data=x;
    newnode->next=0;
    if (front==0&rear==0)
    {
        front=rear=newnode;
    }
    else
    {
        rear->next=newnode;
        rear=newnode;
    }
}
void dequeue()
{
    struct node*temp;
    if (front==0&rear==0)
    {
        printf("the queue is empty");
    }
    else
    {
        temp=front;
        front=front->next;
        free(temp);
    }
}
void display()
{
    struct node*temp;
    if (front==0&rear==0)
    {
        printf("the queue is empty");
        
    }
    else
    {
        temp=front;
        while(temp!=0)
        {
            printf(" %d",temp->data);
            temp=temp->next;
            
        }
    }
}
void peek()
{
    if (front==0&rear==0)
    {
        printf("the queue is empty");
    }
    else
    {
        printf("\nThe peak element is : %d",front->data);
    }
}
void main()
{
    enqueue(1);
    enqueue(1);
    enqueue(5);
    enqueue(7);
    enqueue(6);
    enqueue(9);
    enqueue(12);
    enqueue(65);
    enqueue(4);
    dequeue();
    dequeue();
    dequeue();
    display();
    peek();
}