INFO

An Data Structures vs. Abstract Data Types that follows the Last In First Out (LIFO) procedure.

  • Store in order of the items added into the list
  • remove the last item to go back to the previous

Stack ADT

  • Linearly ordered list
  • Last-in / First-out
  • Elements are added and removed from one end only

Member functions