LIFO (last-in, first-out)

LIFO (last-in, first-out)
- About

About

LIFO means last-in, first-out and is the queue operation where the last element added is the first element removed. The element removed is the youngest element in the queue whereas in a FIFO it's the oldest one.

You will find this operation implemented:

in a stack (LIFO)
in a double ended queue (FIFO and LIFO)

Recommended Pages

Queue - deque (Double Ended Queue)

Queue - deque (Double Ended Queue) About A deque is a Double Ended QUEue meaning that the queue can insert, retrieve and remove at both ends. A deque implements then: * FIFO (first-in, first-ou "...

Collection - Queue (FIFO)

A queue is collection: that follows by default a first-in, first-out methodology where the first element is the first element to be retrieved / removed where the concept of first may be defined. Fo "...

FIFO (first-in, first-out)

FIFO means first-in, first-out and is the queue operation where the element removed is the oldest one in the queue (whereas in a LIFO it's the youngest one) You will find this operation: in a basic q "...

Share this page: