Circular Tree

//Circular Tree
#include
#include

#define SIZE 5
int a[SIZE];
int rear, front;
void insert();
void delete1();
void display();

void main()
{
int ch;
clrscr();

rear = front = 0;
do
{
printf("\n\nWhat u have to do?\n1.Insert\n2.Delete\n3.Display\n4.Exit\nEnter:");
scanf("%d", &ch);
switch(ch)
{
case 1:
insert();
break;

case 2:
delete1();
break;

case 3:
display();
break;

case 4:
exit();
break;
}
}while(ch!=4);
getch();
}

int full()
{
if(front == rear+1 (rear == SIZE -1 && front == 0))
return 1;
else
return 0;
}

int empty()
{
if(front == rear)
return 1;
else
return 0;
}

void insert()
{
int key;
if(full()==1)
printf("\nQueue full!!!!!\nCant insert!!!!!");
else
{
printf("\nEnter element to be inserted:");
scanf("%d",&key);
a[rear] = key;
if(rear == SIZE - 1)
rear = 0;
else
rear++;
}
}

void delete1()
{
int key;
if(empty()==1)
printf("\nQueue empty!!!!!\nCant delete!!!!!!");
else
{
key = a[front];
printf("\nElement deleted is %d", key);
if(front == SIZE-1)
front = 0;
else
front++;
}
}

void display()
{
int i;
printf("\nThe queue is:");
for(i=front; i!=rear; i++)
{
printf(" %d", a[i]);
if(i==4)
{
i = -1;
}
}
}