1. Queue & List Data Structures & Algorithm

2. 2012-20132 Abstract Data Types (ADTs) ADT is a mathematically specified entity that defines a set of its instances, with: a specific interface – a collection of signatures of methods that can be invoked on an instance, a set of axioms that define the semantics of the methods (i.e., what the methods do to instances of the ADT, but not how)

3. October 18, 20013 Queues A queue differs from a stack in that its insertion and removal routines follows the first-in-first-out (FIFO) principle. Elements may be inserted at any time, but only the element which has been in the queue the longest may be removed. Elements are inserted at the rear (enqueued) and removed from the front (dequeued) Front Rear Queue

4. October 18, 20014 Queues (2) The queue supports three fundamental methods: Enqueue(S: ADT, o: element ): ADT - Inserts object o at the rear of the queue Dequeue(S: ADT ): ADT - Removes the object from the front of the queue; an error occurs if the queue is empty Front(S: ADT ): element - Returns, but does not remove, the front element; an error occurs if the queue is empty

5. October 18, 20015 Queues (3) These support methods should also be defined: New(): ADT – Creates an empty queue Size(S: ADT ): integer IsEmpty(S: ADT ): boolean Axioms: Front(Enqueue(New(), v)) = v Dequeque(Enqueue(New(), v)) = New() Front(Enqueue(Enqueue(Q, w), v)) = Front(Enqueue(Q, w)) Dequeue(Enqueue(Enqueue(Q, w), v)) = Enqueue(Dequeue(Enqueue(Q, w)), v)

6. October 18, 20016 An Array Implementation Create a queue using an array in a circular fashion A maximum size N is specified. The queue consists of an N-element array Q and two integer variables: f, index of the front element (head – for dequeue) r, index of the element after the rear one (tail – for enqueue)

7. October 18, 20017 An Array Implementation (2) “wrapped around” configuration what does f=r mean?

8. October 18, 20018 An Array Implementation (3) Pseudo code Algorithm size() return (N-f+r) mod N Algorithm isEmpty() return (f=r) Algorithm front() if isEmpty() then return Error return Q[f] Algorithm dequeue() if isEmpty() then return Error Q[f]=null f=(f+1)modN Algorithm enqueue(o) if size() = N - 1 then return Error Q[r]=o r=(r +1)modN

9. 9 Implementing a Queue with a Singly Linked List Nodes connected in a chain by links The head of the list is the front of the queue, the tail of the list is the rear of the queue. Why not the opposite?

10. October 18, 200110 Dequeue - advance head reference Inserting at the head is just as easy Linked List Implementation

11. October 18, 200111 Enqueue - create a new node at the tail chain it and move the tail reference How about removing at the tail? Linked List Implementation (2)

12. 12 Implementing Deques with Doubly Linked Lists Deletions at the tail of a singly linked list cannot be done in constant time. To implement a deque, we use a doubly linked list. with special header and trailer nodes A node of a doubly linked list has a next and a prev link By using a doubly linked list, all the methods of a deque run in O(1) time.

13. 13 Implementing Deques with Doubly Linked Lists (cont.) When implementing a doubly linked lists, we add two special nodes to the ends of the lists: the header and trailer nodes. The header node goes before the first list element. It has a valid next link but a null prev link. The trailer node goes after the last element. It has a valid prev reference but a null next reference. NOTE: the header and trailer nodes are sentinel or “dummy” nodes because they do not store elements. Here’s a diagram of our doubly linked list:

14. 14 Implementing Deques with Doubly Linked Lists (cont.) Here’s a visualization of the code for removeLast().

15. October 18, 200115 Double-Ended Queue A double-ended queue, or deque, supports insertion and deletion from the front and back The deque supports six fundamental methods InsertFirst(S: ADT, o: element ): ADT - Inserts e at the beginning of deque InsertLast(S: ADT, o: element ): ADT - Inserts e at end of deque RemoveFirst(S: ADT ): ADT – Removes the first element RemoveLast(S: ADT ): ADT – Removes the last element First(S: ADT ): element and Last(S: ADT ): element – Returns the first and the last elements

16. October 18, 200116 Stacks with Deques Implementing ADTs using implementations of other ADTs as building blocks Stack MethodDeque Implementation size() isEmpty() top()last() push(o)insertLast(o) pop()removeLast()

17. October 18, 200117 Queues with Deques Queue MethodDeque Implementation size() isEmpty() front()first() enqueue(o)insertLast(o) dequeue()removeFirst()

18. 18 The Adaptor Pattern Using a deque to implement a stack or queue is an example of the adaptor pattern. Adaptor patterns implement a class by using methods of another class In general, adaptor classes specialize general classes Two such applications: Specialize a general class by changing some methods. Ex: implementing a stack with a deque. Specialize the types of objects used by a general class. Ex: Defining an IntegerArrayStack class that adapts ArrayStack to only store integers.

19. October 18, 200119 Circular Lists No end and no beginning of the list, only one pointer as an entry point Circular doubly linked list with a sentinel is an elegant implementation of a stack or a queue