Lists, Stacks, and Queues

Lists, Stacks, and Queues

1. Stacks

   • The stack is a list-like structure in which elements may be inserted or removed from only one end
   • e this restriction makes stacks less flexible than lists, it also makes stacks both efficient (for those operations they can do) and easy to implement
   • Many applications require only the limited form of insert and remove operations that stacks provide
   • Array-Based Stacks
   • Linked Stacks

2. Queues

   • the queue is a list-like structure that provides restricted access to its elements.
     • Queue elements may only be inserted at the back (called an enqueue operation) and removed from the front (called a dequeue operation)
   • Array-Based Queues
   • Linked Queues