Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
In this problem, you will complete the implementation of the addlast method in a single linked list. The add last method should add a new node to the end of the linked list Do not modify the list to be doubly linked. Remember that lists can be in two states: empty or with some elements (1 or more) The P1 class will run the test cases by reading inputs from the user and calling the addLast method. It will print the list after each addLast call Example Input Output Jane -> Jane -> Mike -> Jane -> Mike -> Bob -> 3 Jane Mike Bob

In this problem, you will complete the implementation of the addlast method in a single linked list. The add last method should add a new node to the end of the linked list Do not modify the list to be doubly linked. Remember that lists can be in two states: empty or with some elements (1 or more) The P1 class will run the test cases by reading inputs from the user and calling the addLast method. It will print the list after each addLast call Example Input Output Jane -> Jane -> Mike -> Jane -> Mike -> Bob -> 3 Jane Mike Bob

Database System Concepts
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
icon
Related questions
Question

Java. Refer to screenshot. There is starter code. I need help with the method.

public class LinkedList {
Node head;
Node tail;

protected class Node{
String data;
Node next;
}

public void addLast(String s){
//Complete the method here
}

public String toString(){

String result = "";

Node n = head;
while(n != null){
result += n.data + " -> ";
n = n.next;
}

return result;
}


}

 

 

//DO NOT MODIFY THIS CLASS
//All work must be done in the LinkedList.java class
import java.util.Scanner;

public class P1 {
public static void main(String[] args) {
Scanner kb = new Scanner(System.in);
int numNames = kb.nextInt();

LinkedList list = new LinkedList();
for (int i = 0; i < numNames ; i++) {
list.addLast(kb.next());
System.out.println(list);
}
}
}

In this problem, you will complete the implementation of the addLast method in a slngle linked list. The add last method should add a new node to the end of the linked list Do not modlfy the lst to be doubly Ilnked. Remember that lists can be in two states: empty or with some elements (1 or more) The Pl class will run the test cases by reading inputs from the user and calling the addLast method. It will print the list after each addlast call Example Input Output Jane -> Jane -> Mike -> Jane -> Mike -> Bob -> 3 Jane Mike Bob
Transcribed Image Text:In this problem, you will complete the implementation of the addLast method in a slngle linked list. The add last method should add a new node to the end of the linked list Do not modlfy the lst to be doubly Ilnked. Remember that lists can be in two states: empty or with some elements (1 or more) The Pl class will run the test cases by reading inputs from the user and calling the addLast method. It will print the list after each addlast call Example Input Output Jane -> Jane -> Mike -> Jane -> Mike -> Bob -> 3 Jane Mike Bob
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Avoiding deadlock
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
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
SEE MORE TEXTBOOKS