Applications of this type of data structure include parsing mathematical expressions and calling subroutines from parent programs, but NOT reading from an input stream or running processes in the order in which they were called. It can be implemented in order-one time in real life as a to-do box which is open at only one end, or in a program by a singly-linked list, since 
Applications of this type of data structure include parsing mathematical expressions and calling subroutines from parent programs, but NOT reading from an input stream or running processes in the order in which they were called. It can be implemented in order-one time in real life as a to-do box which is open at only one end, or in a program by a singly-linked list, since pushing and popping can all be done at the head. FTP, name this data structure which uses a last-in, first-out system.
Applications of this type of data structure include parsing mathematical expressions and calling subroutines from parent programs, but NOT reading from an input stream or running processes in the order in which they were called.
stack (prompt on "LIFO" or "last-in, first-out" on early buzz)