COMP 3 - Stacks and Queues

Key points:
  • Stacks are LIFO
  • Queues are FIFO
  • 'Shuffling' items in memory is slow
  • Therefore both are usually implemented with pointers
  • Circular queues avoid some of the problems with limited storage