First-In-First-Out (FIFO) data structure. Elements are added at rear and removed from front.
n elements stored between front and rear pointers