How Queue Works

Queue: A data structure that follows the FIFO (First In, First Out) principle. This means the first item added is the first one to be removed.

• enqueue(value) - Add a new item to the rear of the queue.
• dequeue() - Remove the item at the front of the queue.
• peek() - View the front item without removing it.
• print() - Display all items in order.
• front - The current front item.
• rear - The current rear item.
• max() - Show the maximum value.
• min() - Show the minimum value.
• sum() - Calculate the sum of all values.
• average() - Calculate the average value.
• count() - Show the number of items.
• swap(a, b) - Swap two items if they both exist.
• reverse() - Reverse the order of items.
• sort() - Sort items in ascending order.
• clear() - Remove all items from the queue.