#include<stdio.h>
#include<conio.h>
#include<alloc.h>
#include<stdlib.h>
struct Node{
	int data;
	struct Node *next;
};
struct Node * allocate(){
		struct Node *t;
		t = (struct Node *)malloc(sizeof(struct Node));
		t->next = NULL;
		return t;
}

void traverse(){
   int i;
   for(i=front;i<=rear;i++){
      printf("%d\t",Queue[i]);
   }
}  

 void deleteval(){
	 int val;
	 if(front == -1){
	   printf("underflow");
	 }
	 else{
         ...

void insert(){
	 int val;
	 if(rear == SIZE-1){
	   printf("Overflow");
	 }
	 else{ 
             ..

void peep(){
	 int pos;
	 printf("Enter position:");
	 scanf("%d",&pos);
	 if(top-pos+1 < 0){
	     printf("invalid Position");
	 }
	 else{
	     ...