QUEUE - A List of Elements
:
Print this page
delete operation :
delete_circular
(item,queue,rear,front)
{
if (front = = rear)
print ("queue is empty");
else
{
front= front+1;
item= queue[fromt];
}
}
Visual Idea of Delete_Circular Operation
Prev
Next