last-in, first-out


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

Go to the Dictionary of Algorithms and Data Structures home page.

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

Entry modified 17 September 2015.
HTML page formatted Fri Feb 23 10:06:08 2018.

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: