Static, Dynamic and Circular Stacks and Queues

IB Standards Covered

5.1.7 Construct algorithms using the access methods of a stack.
5.1.8 Describe the characteristics and applications of a queue.
5.1.9 Construct algorithms using the access methods of a queue
5.1.10 Explain the use of arrays as static stacks and queues.

Like other data structures, stacks and queues can be static or dynamic. Static queues and stacks are instantiated with a certain capacity that can not be changed in the future. Dynamic queues and stacks grow and shrink automatically, without the need of setting a capacity.

Static queues and stacks can be implemented with arrays, while dynamic stack and queues can be implemented (among other ways) with nodes.

Below you can find an overview of static versions, including a circular queue, that can be implemented.