A Queue is a FIFO (First In First Out) data structure. Elements are added at the rear and removed from the front, so the first element enqueued is the first one dequeued. This is the fundamental defining characteristic of a queue. Option C is LIFO which describes stacks. Options B and D are variations not matching standard terminology.