Static Data Structure

Static Data Structure Example

Static Data Structure Benefits

Dynamic Data Structure

Static Data Structure Drawbacks

Dynamic Data Structure Examples

Dynamic Data Structure Benefits

Dynamic Data Structure Drawbacks

The Heap

Queue
FIFO

Queue Variables

Remove Data from a Queue
(DeQueue)

Stack
LIFO

Add data to a Queue
(EnQueue)

Push and Pop

Stack Variables

Add data to Stack (Push)

Remove item from Stack (Pop)

Circular Queue

Reverse items in a Queue

What happens when a stack is full?

In a queue, if the front and rear pointers are at the same location what does this mean?

What happens if you try and remove an item from an empty stack?

Where is an item removed from a queue?

Where is an item removed from a stack?

Where is an item added to a queue?

What is a Dynamic structure memory benefit

What does a programmer have to do to implement a static data structure?