Example: barber

STACKS,QUEUES AND LINKED LISTS - Purdue University

Stacks, Queues, and Linked Lists 2 Stacks •Astack is a container of objects that are inserted and removed according to the last-in-first-out (LIFO) principle. • Objects can be inserted at any time, but only the last (the most-recently inserted) object can be removed. • Inserting an item is known as “pushing” onto the stack.

Tags:

  Stack

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Transcription of STACKS,QUEUES AND LINKED LISTS - Purdue University

Related search queries