I want two different copies for the same project.
You are required to implement a min Heap, called [url removed, login to view] which implements the MinHeap interface provided. Your Heap may allow duplicates to be stored and it does not matter how you determine ordering for two nodes of the same value. As well as the usual Heap methods of add, peek and remove, your Heap class must include an additional method which determines whether or not a given ArrayList of Integers is in correct order to represent a min Heap.
You also need a method which returns the ArrayList of Integers which represents the Heap; this is just for testing/marking purposes and is not a usual Heap method. Your Heap data should be stored in an ArrayList of Integers where every element is used for storage i.e. you should not leave the 0th element empty. The methods you must implement are given in the MinHeap interface. You must implement a class called MyMinHeap that implements this interface. Make sure your class passes the tests in HeapTester.
NB: You must implement this class yourself and not use a built in library or one you’ve found.
The [url removed, login to view] interface is provided for you, you must not change this in any way. The MinHeap interface describes how each of the functions you are required to implement are supposed to work. A test class called HeapTester is provided which can be used to test your min Heap works correctly.