Advances in stacks: Growable Stack, Circular Stack

1. Advances in Stacks
-Rushabh Shah

2. Circular Stack

3. • A circular stack is a data structure that uses a single, fixed-size buffer
as if it were connected end-to-end.
• The useful property of a circular stack is that it does not need to have
its elements shuffled around when inserting the elements. (If a
standard stack were used then it would be necessary to shift all
elements)
• In other words, the circular stack is works as FIFO, while a standard
stack works as LIFO.
• A linked list approach is preferred.

4. Working

5. • circstack.cpp

6. Growable Stack

7. • Growable Stack is the concept of allocating more memory such that
“stack full” condition does not arises easily.
• A Growable array-based Stack can be implemented by allocating new
memory larger than previous stack memory and copying elements
from old stack to new stack.
• And then at last change the name of new stack to the name which
was given to old stack

8. Working

9. • growablestack.cpp