Skip to content
This repository has been archived by the owner on Aug 22, 2022. It is now read-only.

Stacks and queues

Jump to bottom
Michael Nikitochkin edited this page Apr 5, 2018 · 1 revision

Fundamental data types.

  • Value: collection of objects.
  • Operations: insert, remove, iterate, test if empty. ・Intent is clear when we insert.
  • Which item do we remove?

Stack

Examine the item most recently added. Queue. Examine the item least recently added. LIFO = "last in first out"

Queue

Examine the item least recently added FIFO = "first in first out"

Clone this wiki locally