This challenge is different in that the coding is mostly you are start with a clean slate.
Rules:
- Code each of the four specialized linear structures (Stack, Queue, Deque, Bag)
- Your code should support both linked and arrayed types of each of the four. In other words, for you need to support a linked Stack (elements are stored as linked -- e.g., LinkedList) and arrayed stack (elements are stored as arrayed -- e.g., DynamicArray)
- You must code Java interfaces to match the provided ADTs (you can have either four or five interfaces -- five if you use a "super-interface")
- Each of your classes must implement an ADT (Java interface)
- Each of your classes must support a generic element type (You can call it
<E>
or another name if you prefer) - Two sample test cases are provided -- your classes should run and pass those test cases (note these are just a subset of test cases that are similar to what the grader will use)