A queue is a restricted list where insertion occurs at one end and deletion occurs at the other end, following a first-in first-out (FIFO) approach. Basic queue operations include enqueue to insert at the rear and dequeue to delete from the front. A circular queue is a queue that works in a circular manner such that when one end is reached, it starts over from the other end. Circular queue operations include enQueue to insert at the rear and deQueue to delete from the front.

1. Queue

2. The Queue
Another form of restricted list
Insertion is done at one end, whereas deletion is performed at the other end
Basic operations:
enqueue: insert an element at the rear of the list
dequeue: delete the element at the front of the list
First-in First-out (FIFO) list

16. Circular Queue

17. Circular Queue

18. Circular Queue

19. Circular Queue

24. Circular Queue Operations
• Queue Front: Get the front item from queue with
retaining it.
• Queue Rear: Get the last item from queue with
retaining it.
• enQueue(value) This function is used to insert an
element into the circular queue. In a circular queue, the
new element is always inserted at Rear position.
• deQueue() This function is used to delete an element
from the circular queue. In a circular queue, the
element is always deleted from front position.

40. Consider a linked queue having 3 data elements 3, 17, 43,
respectively. It arranges all these elements according to
priority. Since 2 is smaller(Higher priority) than the element
at the front (head) node, insertion from the front will be more
efficient.

41. For instance, say you want to insert a node consisting of
element 45. Here, it will compare element 45 with each
element inside the queue.