ngetest otak...

#include<stdio.h>
#define MAX 5

typedef struct node{
int isi[MAX];
};
node queue;
int head,tail,outdisplay;

void inisialisasi(){
head = 1;
tail = MAX;
}
void insert(){
int data;
printf("Enter a Value : ");scanf("%d",&data);
int x;
x =(tail%MAX)+1;
if((x%MAX)+1!=head){
tail=(tail%MAX)+1;
queue.isi[tail]=data;
outdisplay++;
}else{
printf("QUEUE is FULL");
}
}
void deleted(){
if((tail%MAX)+1!=head){
for(int i=head; i<=outdisplay; i++){
queue.isi[i]=queue.isi[i+1];
}
outdisplay--;
}else{
printf("QUEUE is Empty");
}
}
void display(){
if((tail%MAX)+1==head){
printf("QUEUE is Empty");
}else{
for(int i=head; i<=outdisplay; i++){
printf("[%d] ",queue.isi[i]);
}
}
printf("\n");
}

main()
{
int choise; char ch='o';
inisialisasi();
while(ch != 'n'){
printf("=================\n");
printf("    QUEUE\n");
printf("=================\n");
printf(" 1. InsertQueue\n");
printf(" 2. DeleteQueue\n");
printf(" 3. Display\n");
printf(" 0. End Program\n");
printf("=================\n");
printf(" Choise : ");scanf("%d",&choise);
switch(choise){
case 1: {insert();} break;
case 2: {deleted();} break;
case 3: {display();} break;
case 0: default: {ch='n';} break;
}
}
printf("\nEnd Program\n");

return 0;
}