With the exception of the concept of an iterator, which we will return to in a moment, the linked list class is rather simple and conventional. Operations are provided to push a value on to the list and pop the first element. Another operation is used to tell if the collection is empty.