Queue Description A FIFO(First-In First-Out) data structure where the first element added to the queue is the first to be removed. Usefulness Generally used for background tasks, job scheduling, and breadth-first search.