Chapter 16.3, Problem 15SC

Explanation of Solution

Reason:

• When stack is implemented as an array, the values are stored in the array, as a result the storage of node references are saved.
• Since more elements are pushed onto the stack, naturally an array may fill up in the end.
• An array should expand, when it achieves full.
• It is a better idea to pop and push the elements at the front end, when a stack is implemented as a sequence of nodes...