The queue is currently empty.
A queue is a linear data structure that follows the First In First Out (FIFO) principle. Elements are added from the rear and removed from the front.
Time Complexity
Enqueue: O(1), Dequeue: O(1)
Space Complexity
O(n)
No operations yet
1.procedure enqueue(queue, value) 2. rear = rear + 1 3. queue[rear] = value 4.end procedure 5. 6.procedure dequeue(queue) 7. if queue is empty then 8. return "Queue Underflow" 9. value = queue[front]10. front = front + 111. return value12.end procedure
