Question

Design and implement a data structure called a drop-out stack that behaves like a stack in every respect except that if the stack size is n, when the n+1 element is pushed, the first element is lost. The implementation will require the use of an array, hint use a circular array.

Answer 1

Answer:

There is a data structure called drop-out stack that behaves like a stack in every respect except that if the stack size is n, then when n+1 element is pushed, the first element is lost. Implement a drop-out stack using links. Code in Java with main class.