A queue is a data structure that works on the principle of “first in, first out”. That is, the element that is added to the queue first will be the first one to be removed from it. The main operations that can be performed on a queue are enqueue and dequeue.
The enqueue operation adds an element to the end of the queue, while the dequeue operation removes an element from the front of the queue. In addition to these two operations, there is also a peek operation, which allows you to view the element at the front of the queue without removing it.
3. Finding Peek In Queue
1. It creates a new queue.
2. It checks that the queue is empty.
3. It adds two items to the queue.
4. It checks that the first item in the queue is 1.
5. It checks that the first item in the queue is still 1.
6. It checks that the queue is still empty.
7. It checks that the queue is still empty.
A row, like a stack, can be implemented using various data structures (lists, arrays, etc.).
FIFO queue representation. Queues are useful for a variety of purposes:
Main goal of Peek is, that it returns the element at the front the container.