Problem
A circular linked list has no need of a head or tail. Instead you only need to reference an arbitrary item. Implement a circular linked-list class. Note that the begin() and end() functions will return iterators that reference the same node. You will, however, need to distinguish between them so that you can use the standard library algorithms.