Question: 1-Implement A generic List interface, which encapsulates the ADT for a list data structure. That has the following Get data stored in head node of

 1-Implement A generic List interface, which encapsulates the ADT for a
list data structure. That has the following Get data stored in head

1-Implement A generic List interface, which encapsulates the ADT for a list data structure. That has the following Get data stored in head node of list. */ public T getFirst . Get the head node of the list. / public ListNode getFirstNode : Get data stored in tail node of list. **/ public T getLast : Insert a new node with data at the head of the list. / public void insertFirst (I data); Insert a new node with data after currentNode public void insertAfter (ListNode currentNode, T data); Insert a new node with data at the tail of the list. */ public void insertLast (T data Remove head node public void delete First : Remove tail node public void delete Last : - Remove node following currentNode If no node exists (ie, currentNode is the tail), do nothing public void delete Next (ListNode currentNode); / / Get the number of elements in this list public int size . Check if the list is empty. public boolean IsEmpty : / Then implement A generic LinkedList class, which implements List interface A generic LinkedListNode class A Junit test class LinkedList Tester, which should test all the functions you imple- mented in your LinkedList class and LinkedListNode class. 1-Implement A generic List interface, which encapsulates the ADT for a list data structure. That has the following Get data stored in head node of list. */ public T getFirst . Get the head node of the list. / public ListNode getFirstNode : Get data stored in tail node of list. **/ public T getLast : Insert a new node with data at the head of the list. / public void insertFirst (I data); Insert a new node with data after currentNode public void insertAfter (ListNode currentNode, T data); Insert a new node with data at the tail of the list. */ public void insertLast (T data Remove head node public void delete First : Remove tail node public void delete Last : - Remove node following currentNode If no node exists (ie, currentNode is the tail), do nothing public void delete Next (ListNode currentNode); / / Get the number of elements in this list public int size . Check if the list is empty. public boolean IsEmpty : / Then implement A generic LinkedList class, which implements List interface A generic LinkedListNode class A Junit test class LinkedList Tester, which should test all the functions you imple- mented in your LinkedList class and LinkedListNode class

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!