Queue

Explanation: The collection that follows the FIFO (first-in, first-out) principle. Elements are added at the end and removed from the start, similar to a real-life queue. It commonly used for breadth-first search and task scheduling algorithms.