last-in, first-out

(definition)

Definition: A policy that the most recently arrived item is processed first. A stack implements this.

See also first-in, first-out, LCFS hashing.

Note: A depth-first search checks newly encountered nodes last-in, first-out.

Author: PEB

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 September 2015.
HTML page formatted Mon May 11 15:07:57 2026.

Cite this as:
Paul E. Black, "last-in, first-out", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 September 2015. (accessed TODAY) Available from: /HTML/lastfirstout.html