Ordered Linked List Iterator

[programmercarlito]

Just want to make sure what the iterator exactly does in a linked list. Is it like the push function but this is for nodes?

linkedListIterator<Type> operator++();    
      //Overload the preincrement operator.
      //Postcondition: The iterator is advanced to the next node.

and Im also having trouble understanding what these two lines mean.

bool operator==(const linkedListIterator<Type>& right) const;
      //Overload the equality operator.
      //Postcondition: Returns true if this iterator is equal to 
      //    the iterator specified by right, otherwise it returns
      //    false. 

 bool operator!=(const linkedListIterator<Type>& right) const;
      //Overload the not equal to operator.
      //Postcondition: Returns true if this iterator is not equal to
      //    the iterator specified by right, otherwise it returns
      //    false. 

[programmercarlito]

By the way those comments are from the book which I cannot understand. Can anybody explain it a different way? Thanks

[MiiNiPaa]

Iterator does in linked list exact same thing what it does in vector, array, and other containers. It is an universal pattern:
http://www.cprogramming.com/tutorial/stl/iterators.html
http://en.wikipedia.org/wiki/Iterator