return false endif end procedure if the value of front is less than min or it tells that the queue is not yet initializedhence empty here' the programming code example bool isempty(if(front rearreturn trueelse return falseenqueue operation queues maintain two data pointersfront and rear thereforeits operations are comparatively difficult to implement than that of stacks the following steps should be taken to enqueue (insertdata into queue step check if the queue is full step if the queue is fullproduce overflow error and exit step if the queue is not fullincrement rear pointer to point the next empty space step add data element to the queue locationwhere the rear is pointing step return success sometimeswe also check to see if queue is initialized or notto handle any unforeseen situations algorithm for enqueue operation procedure enqueue(dataif queue is full return overflow