Containing operations which allow adding to the tail and removing from the head, for ten points, identify this abstract data structure which unlike a stack is based on the principle of first-in-first-out.
This is the only data structure or type that exists in the Oroogu language created by Georg Kraml. In declarative languages, one of its most common operations require big-O of n time instead of big-O of 1, because that operation requires the rebuilding of the entire list. Associative arrays may be used to implement one variety of these structures, but heaps are generally more efficient in implementing the priority type. Containing operations which allow adding to the tail and removing from the head, for ten points, identify this abstract data structure which unlike a stack is based on the principle of first-in-first-out.
This is the only data structure or type that exists in the Oroogu language created by Georg Kraml.
{queue}