answers: a stack
context: Associative array In computer science, an associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears at most once in the collection. Operations associated with this data type allow: The dictionary problem is a classic computer science problem: the task of designing a data structure that maintains a set of data during 'search', 'delete', and 'insert' operations. The two major solutions to the dictionary problem are a hash table or a search tree. In some cases it is also possible to solve the problem </s> Stack (abstract data type) In computer science, a "stack" is an abstract data type that serves as a collection of elements, with two principal operations: The order in which elements come off a stack gives rise to its alternative name, LIFO (last in, first out). Additionally, a peek operation may give access to the top without modifying the stack. The name "stack" for this type of structure comes from the analogy to a set of physical items stacked on top of each other, which makes it easy to take an item off the top of the stack, while getting to </s> argue that original order "retains little meaning in postmodern archives where origins are never final, but the subjects of new histories waiting to be done. When records arrive at an archives, they will have an order of some kind, but it will not likely be the actual original order of the records, as documents can be easily and repeatedly moved around prior to archiving them." In today's modern age, technology ensures that fonds and collections are continuously growing, which makes knowing the original order difficult. Another criticism of original order is that it prioritizes the system of arrangement of records
question: when items are to be retrieved in reverse order from which they were stored we use