An Implementation of linked Lists Using C++

All the necessary classes for the implementation of a singly linked list are developed and presented in full. The list is non intrusive and depends on an iterator class which is also presented. The ease of use of the list developed is demonstrated through an example. The example also shows that the list can store objects of any complex structure. The entire approach to the development is based on object oriented programming principles. The list implementation can be easily adopted to doubly linked lists, binary and multiway trees and general graphs