A first-in, first-out data structure where the first item added is the first one removed.
A data structure that follows the FIFO (first-in, first-out) principle, used for tasks such as processing work in order. Implementing a queue with a plain array would require shifting every remaining element on each removal from the front -- O(n) -- so real implementations typically use a circular buffer or linked list to get O(1) add and remove instead.
© 2026 ITBGM