struct Node{
	int data;
	struct Node *next;
};
struct Node * allocate(){...

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

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

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

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

void pop(){
	  int val;
	  if(top==-1){
		printf("underflow");
	  }...