Chapter 13.2, Problem 11STE

Program Plan Intro

Stack:

• A stack denotes a data structure that retrieves data in reverse of order in which data is stored.
• The top items present in the stack are to be removed first.
• It is called as a last in first out data structure.
• It could be used for keeping track of function calls in a program.
• The insertion as well as removal of elements takes place at same end.
• The upper part of stack where insertion and removal takes place is known as “top”.
• The part opposite to “top” is termed as “base” of stack.
• It provides an ordering based on length of time in collection.
• The newer items will be near top whereas older items are near base.