2 LinkedList remove and iteratorYour class ICS211LinkedList.java must have the exact same class variables as LinkedList.java, that is, head, tail, and size. You must also keep the checkInvariants() method, and call it at the beginning and end of both of the two publicmethods (remove and iterator) you must add in creating your ICS211LinkedList class.2.1 LinkedList removeImplement the E remove(int index) method defined by the java.util.List interface.Removing a node from a linked list requires access to the node preceding the node to be removed. This means you must have a loop which starts at the head and follow the links until you are at the correct index.If the index is size-1, which is the last valid index of the list, remember to update the tail reference.If the index is 0, this is a special case that updates the head reference. If the list only has one element, the tail reference must also be updated.Make sure your code works correctly for• an empty list (must throw IndexOutOfBoundsException.html)●illegal indices (must throw IndexOutOfBoundsException.html)• a list of size 1removing the first value• removing the last value2.2 LinkedList iteratorIn your ICS211LinkedList class, implement the iterator (.) method.2.3 LinkedListIterator removeIn your LinkedListIterator private class, implement the remove (.). method.Note that the remove method of the ICS211LinkedList class returns the value removed, and the remove method of the private LinkedListIterator class does not.Also, to avoid having to loop in the remove method, you must add a class variable to the LinkedListIterator private class. This new class variable must keep track of the previous node. When the iterator is first created, there is no previous node,so the constructor must initialize this variable to null. If remove is called before the first call to next, remove must throw an IllegalStateException. Every call to the next () method must update the value of this variable.As in the linked list remove method, you must also take into consideration special cases of removing the first and the last elements of the linked list.The implementation of this method is must not call the remove method of the ICS211LinkedList class, which takes O(n) time -- this method must work in O(1) time and is not allowed to have any loops.

Ics211LinkedList.java: import java.util.List;import java.util.NoSuchElementException; public class…

Answered: 2 LinkedList remove and iterator

Engineering

Computer Science

2 LinkedList remove and iterator

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In a linked list, devise an approach that will remove all nodes with the same key.
Write a method LinkedList<Integer> joinLists (LinkedList<Integer> list1, LinkedList<Integer> list2) to join two linked lists into one and return the resulting linked list
In what way does a netlist serve a purpose?
The nodes of the strongest linkedlist are undetermined.Is one especially lengthy?
What is an iterator? Why are iterators often used with linked lists?
Our hash map's data is stored in a LinkedList due to its design. A hash map's usefulness decreases.
Java Programming
Simple JAVA linkedlist code implementation please help and complete any part you can - Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of LinkedList interface- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Build Bus Route – Linked List- Your task is to:o Implement the LinkedList interface (fill out the implementation shell)o Put your implementation through its paces by exercising each of themethods in the test harnesso Create a client (a class with a main) ‘BusClient’ which builds a busroute by performing the following operations on your linked list:o§ Create (insert) 4 stations§ List the stations§ Check if a station is in the list (print result)• Check for a station that exists, and onethat doesn’t§ Remove a station§ List the stations§ Add a station before another station§ List the stations§ Add a station after another station§ Print the…
What is difference between ArrayList and LinkedList ?
Duplicate-linked list: what is it? What are some of its potential uses?