A Simple Queue, often referred to simply as a "queue," is a fundamental data structure that follows the First In, First Out (FIFO) principle. In a queue, elements are added to the back (enqueue operation) and removed from the front (dequeue operation). This ensures that the element that has been in the queue the longest is the first one to be removed.
