display simple queue list

[Eraphine Astrid]

im having problem with the output
==============
front->12->1>-1813->1813 ->12
==============
where the things at the back shout not be display as the user only entered 1 value which is 12
and it also seems cannot delete number using the dequeue function

#include <stdio.h>
#include <stdlib.h>

typedef struct QUEUE
{	int head, tail;
	int list[4];
}queue;

void create(queue *q);
int full(queue *q);
int empty (queue *q);
void enqueue(queue *q);
void dequeue(queue *q);
void display(queue *q);


void main()   ///main function
{	int choice;
	queue q;
	create (&q);

	display (&q);
	printf("\nEnter choice: \n1-Enqueue \n2-Dequeue \n3-Exit\n");
	scanf("%d", &choice);

	while(choice!=3)
	{	switch (choice)
		{	case 1: enqueue(&q);
					break;
			case 2: dequeue(&q);
					break;
			default:
				printf("\nchoose again");
				break;
			}
			display (&q);
			printf("\nEnter choice");
			scanf("%d", &choice);

	}
	printf("\nEnd of run\n");
}





void create (queue *q)
{	q->head=0;
	q->tail=0;
}

int empty (queue *q)
{	if(q->tail==0)
		return (1);
	else
		return (0);
}

int full (queue *q)
{	if (q->tail==4)
		return (1);
	else
		return (0);
}

void enqueue (queue *q)
{	int data;

	if (full(q)==1)
		printf("\nQueue is full");
	else
	{	printf("\nEnqueue Integer: ");
		scanf("%d",&data);
		q->list[q->tail]=data;
		q->tail++;
	}
}

void dequeue (queue *q)
{	if (empty(q)==1)
		printf("\nQueue is Empty");
	else
		{	q->head++;
		}
}

void display (queue *q)
{	int i;

	if (empty(q)==1)
		printf("\nQueue Empty");
	else
		{	printf("\nFront->");
			for(i=0; i<=3; i++)
				printf("%d->",q->list[i]);
		}
}  

[Smac89]

You are not making use of your queue's internals to display the list. You are simply iterating over everything in the QUEUE::list array. What about QUEUE::head and QUEUE::tail?