Respuesta :
A stack item behaves like Last In First Out, which is equivalent to First In Last Out.
FIFO and LILO are also equivalent, but they describe a queue.
Answer:
Either First-in-last-out (FILO) or Last-in-first-out (FILO)
Explanation:
A stack is a data structure that implements the First-in-last-out (FILO) or Last-in-first-out (FILO) modality. FILO and LIFO are literally the same. They are just alternative ways of saying the same thing. In a stack, the element that is stored in last is retrieved first (LIFO). This also means that the element that is first stored in can be retrieved last.
FIFO which is similar to LILO is used in data structures such as queues but not in stacks.