C/C++ :: Queue Making Using Arrays

I'm trying to write a code that proves a queue like fifo (first in first out). I have four characters :

p(rint),e(nqueue),d(equeue) and q(uit).

The problem is when I press d a first character must get rid of, but not. When I press d the numbers get double.

Example input:
e 2 3 9 8 7
p
2 3 9 8 7
d
p
3 9 8 7
d
p
9 8 7

#include <stdio.h>
void enqueue(int queue[], int newnum, int *tail_p, int maxsize);
void deque(int queue[], int *tail_p, int *elem);
void printqueue(int queue[],int count);

[Code] ....