(definition)
Definition: A policy that the most recently arrived item is processed first. A stack implements this.
See also first-in, first-out.
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 E. Black.
Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "last-in, first-out", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/lastfirstout.html
