dequeue() - returns value and removes least recently added element; empty() full() Cost: a bad implementation using a linked list where you enqueue at the head and dequeue at the tail would be O(n) ...