Having troubling implementing this in c++. If you could prove your implementation using a driver/main.cpp and attaching the code for it as well that would be appreciated! Thanks

Looking ahead in an STL iterator requires an application of operator++ , which in turn advances the iterator. In some cases looking at the next item in the list, without advancing to it, may be preferable. Write the member function with the declaration const_iterator operator+( int k) const; to facilitate this in a general case. The binary operator+ returns an iterator that corresponds to k positions ahead of current