Write insert function of queue in data structure

Insert Function of Queue in Data Structure:

Algorithm fnQinsertion (arrQueue[], Data)
{
if(fnQFull()==TRUE) // Check for queue full condition
Queue is Full;
else
{
arrQueue[rear]=Data; // Insert the item Data onto queue
rear=rear+1;
}
} // End of Algorithm

Leave a Reply

Your email address will not be published. Required fields are marked *