Linked Lists:
Inside View of the LinkedNodeCollection Class

In the previous LinkedNodeCollection mini-labs, you implemented the add, remove, and clear methods in the LinkedNodeCollection class and the add method in the DoublyLinkedNodeCollection class.  In this programming project you will complete implementing those classes and rewrite the Bad News Bearer program to use a LinkedNodeCollection.

Programming Project

• Implement (or finish implementing) the toString, toArray, containsAll, addAll, removeAll, retainAll, and equals methods in LinkedNodeCollection.  Provide javadoc comments for them.  You may wish to review the class documentation for the Collection class before completing this exercise.  Update your test driver to test your new methods.
   
• Analyze which of these methods can be used unchanged in DoublyLinkedNodeCollection, and which need to be updated.  Modify the DoublyLinkedNodeCollection class so that it implements these methods.
   
• Develop "Before" and "After" diagrams for the remove method in DoublyLinkedNodeCollection.   Implement the remove and clear methods.  Test your modified DoublyLinkedNodeCollection class.
   
• Implement the add and remove methods in LinkedNodeCollectionIterator and DoublyLinkedNodeCollectionIterator.  Test the new methods.
   
• Modify the Bad News Bearers program to use your LinkedNodeCollection class and the CircularLCIterator class.  (This class works like CircularLLIterator, except it steps through a LinkedNodeCollection rather than a LinkedList object.)
   
• Hand in:
  • your "Before" and "After" diagrams for the LinkedNodeCollection and DoublyLinkedNodeCollection add and remove methods,
  • your final versions of the LinkedNodeCollection and DoublyLinkedNodeCollection classes, and
  • your final version of the class containing the implementation of the Bad News Bearers problem.

Author: Alyce Brady abrady@kzoo.edu