Page 10 - Fundamentals of Stack in Data Structure
P. 10
rear = front = -1;
}
void enqueue(int x); //declaring enqueue, dequeue and display
functions
int dequeue();
void display();
}
void Queue :: enqueue(int x)
{
if( rear = SIZE-1)
{
cout << "Queue is full";
}
else
{
a[++rear] = x;
}
}
int queue :: dequeue()
