You are required to complete the LinkedList class. This class is used as a linked list that has many methods to perform operations on the linked list. To create a linked list, create an object of this class and use the addFirst or addLast or add(must be completed) to add nodes to this linked list(I created one linked list in TestLinkedList). I've already created the class for you and have some completed method in there, your job is to complete the empty methods. For every method you have to complete, you are provided with a header, Do not modify those headers(method name, return type or parameters). You have to complete the body of the method. public void add (T after This, T info) The parameter info will be the information the new node should contain, and the new node will be added after the node that contains the parameter after This as an information. public void removeFirst() Removes the first node in the linked list. Hint: be aware of empty lists. public void removeLast() Removes the last node in the linked list. Hint: be aware of empty lists. public int size() returns the size of the linked list. public boolean isEmpty() returns true if the linked list is empty, otherwise returns false. public boolean contains (T item) returns true if the list contains a node with the same information as the parameter of the method. Test your method with TestLinked List, complete one method at the time and uncomment the method calls in the main method.

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
icon
Related questions
Question
You are required to complete the `LinkedList` class. This class is used as a linked list that has many methods to perform operations on the linked list. To create a linked list, create an object of this class and use the `addFirst` or `addLast` or `add` (must be completed) to add nodes to this linked list (I created one linked list in `TestLinkedList`). I've already created the class for you and have some completed methods in there, your job is to complete the empty methods.

For every method you have to complete, you are provided with a header. **Do not** modify those headers (method name, return type or parameters). You have to complete the body of the method.

```java
public void add(T afterThis, T info)
```
The parameter `info` will be the information the new node should contain, and the new node will be added after the node that contains the parameter `afterThis` as information.

```java
public void removeFirst()
```
Removes the first node in the linked list. Hint: be aware of empty lists.

```java
public void removeLast()
```
Removes the last node in the linked list. Hint: be aware of empty lists.

```java
public int size()
```
Returns the size of the linked list.

```java
public boolean isEmpty()
```
Returns true if the linked list is empty, otherwise returns false.

```java
public boolean contains(T item)
```
Returns true if the list contains a node with the same information as the parameter of the method.

Test your method with `TestLinkedList`, complete one method at a time and uncomment the method calls in the main method.
Transcribed Image Text:You are required to complete the `LinkedList` class. This class is used as a linked list that has many methods to perform operations on the linked list. To create a linked list, create an object of this class and use the `addFirst` or `addLast` or `add` (must be completed) to add nodes to this linked list (I created one linked list in `TestLinkedList`). I've already created the class for you and have some completed methods in there, your job is to complete the empty methods. For every method you have to complete, you are provided with a header. **Do not** modify those headers (method name, return type or parameters). You have to complete the body of the method. ```java public void add(T afterThis, T info) ``` The parameter `info` will be the information the new node should contain, and the new node will be added after the node that contains the parameter `afterThis` as information. ```java public void removeFirst() ``` Removes the first node in the linked list. Hint: be aware of empty lists. ```java public void removeLast() ``` Removes the last node in the linked list. Hint: be aware of empty lists. ```java public int size() ``` Returns the size of the linked list. ```java public boolean isEmpty() ``` Returns true if the linked list is empty, otherwise returns false. ```java public boolean contains(T item) ``` Returns true if the list contains a node with the same information as the parameter of the method. Test your method with `TestLinkedList`, complete one method at a time and uncomment the method calls in the main method.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Concept of Threads
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education