سؤال عن تركيب البيانات عاجللللللللللللللللللللللللللللل

bool isempty ()
{
return (front==rear);}

bool isfull()
{
return (front==(rear+1)%MQS);}

void add ( int d)
{
if(isfull())
queuefull();
else
queue [(++rear)%MQS]=d;
}

item del ()
{
if ( isempty())
queueempty ():
else
return queue [(++front)%MQS];
}