![boolean delete(T e)
Deletes the first occurrence of an element from the list if it exists, if
an element is removed return true, false otherwise
boolean deleteAll(Collection c)
Deletes all elements within the given collection, this includes dupli-
cates. If it removes an element then return true, otherwise false
1
T mutate(int index, T e)
Sets the element at the given index to the given element and returns
the old element, return null if the index doesnt exist
int length()
Returns the current length of the list
The following functions must also be implemented:
String toString()
Override toString from Object
Should print out with a square bracket at the front and the back of
the list
Each element should be seperated by a comma and a space
For example if your list had the elements 1 2 and 3 then the
output would be [1, 2, 3]
boolean equals(Object o)
Override equals from Object
Should return true if the contents of your list are equal to the contents
of os list, otherwise false
AND THIS IS THE TEST CLASS](https://image.slidesharecdn.com/promptyourtaskistocreateaconnectedlistimplementationand-230331103047-290455f8/85/Prompt-Your-task-is-to-create-a-connected-list-implementation-and-pdf-2-320.jpg)
Prompt Your task is to create a connected list implementation and .pdf
- 1. Prompt Your task is to create a connected list implementation and a contiguous list implementation. Both these classes behaves like a list to users but behind the scenes the connected list class uses a Node class to store the data. This Node class simply holds the data as well as a reference to the next Node in the list. The contiguous list class uses an array to hold the data. Both implementations must implement the ListInterface interface. For contiguous list a few things should be considered The array should start at size 10 When an element is added to the list over the size cap the array must be reallocated with double the size. Then all the data must be copied over from the previous array. then you must add the new element. For simplicity the array will only hold Strings. This means the class implements ListInterface specifically for Strings. I have given you this code in the starter file. The ListInterface has the following functions: void prepend(T e) Adds the given element to front of the list void append(T e) Adds the given element to the end of the list void insert(int index, T e) Inserts the given element add the given index Shifts all elements after the given index up by 1 index void empty() Removes all elements from the list boolean has(T e) Returns true if the given element exists in the list, false otherwise T retrieve(int index) Retrieves the element at the given index, if the index doesnt exist then return null boolean isEmpty() Returns true if the list is empty, false otherwise T delete(int index) Deletes the element at the given index and returns it, if the index doesnt exist then return null
- 2. boolean delete(T e) Deletes the first occurrence of an element from the list if it exists, if an element is removed return true, false otherwise boolean deleteAll(Collection c) Deletes all elements within the given collection, this includes dupli- cates. If it removes an element then return true, otherwise false 1 T mutate(int index, T e) Sets the element at the given index to the given element and returns the old element, return null if the index doesnt exist int length() Returns the current length of the list The following functions must also be implemented: String toString() Override toString from Object Should print out with a square bracket at the front and the back of the list Each element should be seperated by a comma and a space For example if your list had the elements 1 2 and 3 then the output would be [1, 2, 3] boolean equals(Object o) Override equals from Object Should return true if the contents of your list are equal to the contents of os list, otherwise false AND THIS IS THE TEST CLASS