1. Cousin of the Stack

3.  An abstract data type (container class) in which items are entered at one end and removed from the other end  First In First Out (FIFO)  No standard queue terminology  Insertion operations may be called:  enqueue, enque, enq, enter or insert  Deletion operations may be called:  dequeue, deque, deq, delete or remove

4.  Array?  Linked List?

5.  Singly linked?  Doubly linked?

6.  Which End is FRONT of list?  Strategy A: Tail is Front  Strategy B: Head is Front Insert at head of list Delete at tail of list Delete at head of list Insert at tail of list