Consider an ADT circular list , which is like the ADT list but treats its fi rst entry as if it were immediately after its last entry. For example, if a circular list contains six items, retrieval or...

Consider an ADT circular list , which is like the ADT list but treats its fi rst entry as if it were immediately after its last entry. For example, if a circular list contains six items, retrieval or removal of the eighth item actually involves the list’s second item. Let insertion into a circular list, however, behave exactly like insertion into a list. Defi ne and implement the ADT circular list as a derived class of LinkedList .