Which data structure allows elements to be added at one end and removed from the other?

The correct answer is the queue, which is specifically designed to function on a first-in, first-out (FIFO) principle. In a queue, elements are added at the back (tail) and removed from the front (head). This structure is particularly useful in scenarios where you want to maintain the order of processing, such as in task scheduling or handling requests in order.

For practical applications, queues can be likened to a line at a service center, where the first person to arrive is the first to be served. This structure contrasts with others where elements can be accessed or added from different locations. Understanding queues is fundamental in both computer science data structure studies and in practical programming, as they are prevalent in algorithms and processes requiring ordered handling of data.