Chapter 20, Problem 5SA

Program Plan Intro

Array implementation of stack:

• A stack is a linear data structure.
• It follows the order last-in-first-out (LIFO) for performing operations.
• When stack is implementing using an array, create an array with enough memory to hold the stack elements.
• Use integer index “top” for pointing to the top most element of the stack.
• If the element is added into the stack, it checks whether it has sufficient memory to hold the number. If the memory is available, then it will increase the value of “top” and new item is added to that position.
• If the items are removed from the stack, it will check whether stack contains element or not. If elements are available, then the “top” is decremented for deleting element in that position.