Simple JAVA stack code implementation please help in any part you can, please be clear, thank you Given an interface for Stack - Without using the java collections interface (ie do not import java.util.List, LinkedList, Stack, Queue...) - Create an implementation of Stack interface provided - For the implementation create a tester to verify the implementation of that data structure performs as expected Get on the bus – Stack (lifo) - Implement the provided Stack interface ( fill out the implementation shell) - Put your implementation through its paces by exercising each of the methods in a test harness - Add to your ‘BusClient’ the following functionality using your Stack -
Simple JAVA stack code implementation
please help in any part you can, please be clear, thank you
Given an interface for Stack
- Without using the java collections interface (ie do not import java.util.List,
LinkedList, Stack, Queue...)
- Create an implementation of Stack interface provided
- For the implementation create a tester to verify the implementation of that
data structure performs as expected
Get on the bus – Stack (lifo)
- Implement the provided Stack interface ( fill out the implementation shell)
- Put your implementation through its paces by exercising each of the methods in
a test harness
- Add to your ‘BusClient’ the following functionality using your Stack
-
o Create (push) 6 riders by name
§ Iterate over the stack, print all riders
o Peek at the stack / print the result
o Remove (pop) the top of the stack
§ Iterate over the stack, print all riders
o Peek at the stack / print the result
o Add two more riders to the stack
o Peek at the stack & print the result
o Remove all riders from the stack
o Verify the stack is now empty ( print that result )
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 5 images
