student class to demonstrate implementation of a circular list
an implementation of a circular list
Note: the delete method does not work for the first element as I am not relinking properly if the first element in the list is deleted
need to fix this
a simple hash function which takes an integer and returns a value between 0 and 1000-small hash
A simple map implementation
Note: revisit to implement with a growing array
an implementation of a queue using interface
includes the person node, the PersonQueue interface and the PersonQueueImpl, as an implementation of the person queue
finally supermarket is used to create a new object of type PersonQueue and to call all the methods on it
implementing a basic queue of integers with insert(..), retrieve() and size() methods
need to add comments in the next commit
Implemented a stack structure as a doubly linked list
Used a method to print popped element values, which is called within the class only, not impacting the interface