Stacks and Queues

Stacks and Queues

1. Stack

   • Last In, First Out abstract data type. Push=in Pop=out

2. Queue

   • First In, First Out abstract data type
     • Linear queue
       • In one end, out the other
     • Circular queue
       • When array element with largest posible index has been used, the next element to join the array reusues the vacated location at the beginning of the array
     • Priority queue
       • Each element of a priority queue has an associated priority