Question

28) Write an algorithm to insert an element into the QUEUE data structure.​

Answer 1

Answer:

Enqueue Operation

Step 1 − Check if the queue is full. ... Step 3 − If the queue is not full, increment rear pointer to point the next empty space. Step 4 − Add data element to the queue location, where the rear is pointing. Step 5 − return success.