Develop and test two classes:

1. a linked list-based stack ADT that implements the provided StackInterface.java
2. a linked list-based queue ADT that implements the provided QueueInterface.java

These implementations will be considered unbounded because of the use of a linked list for the underlying data structure.

The use of the attached generic singly linked list node class, LLNode.java, is recommended but not required.

Your stack and queue classes MUST be generic.

Please include a toString( ) method in each ADT.

Starting with the C228PP2WriteUpHeadStart document attached below, add an overview or description of your solution for this project. Also update that document with test data or expected results for each item seen with a tan shaded background. Your data entries do not need to be consistent with the ones that already appear in the document. And you are welcome to replace the existing items with your own.

You are encouraged to review the rubric below for details on how the project will be graded.

Your test program will not be reviewed but 10% of the overall grade for this project will be based on whether or not your ADTs pass the instructor's all or nothing test.