Direction: Continue the attached code below. It can only insert a value to a linkedlist. Your goal is to add new functionality to the linkedlist. You may only choose 3 more functions: 1. getValue this function should be able to display a node by specifying its position (index). 2. clear resets the linkedlist by assigning null to head. 3. insertNewHead 4. InsertAt this function can be used to assign a new head to the linkedlist this function can be used to insert a node to a specific location. 5. displayAll this function will display all nodes import java.util.Scanner; class MainLL { public static void main(String[] args) { Scanner sc = new Scanner(System.in); SinglyLL sll new SinglyLL(); String msg="Enter an action: [1] Insert, [2]Get an element, [3] clear, [e]Exit"; System.out.println(msg); int choice sc.nextInt(); while(choice != 0) { switch(choice) ( case 1: System.out.println("Enter a value:"); sll.insert(sc.next()); System.out.println("Successfully added a node!\n" + msg); default System.out.println("Invalid input! Please try again.\n"+msg); break; break; } choice sc.nextInt();
Direction: Continue the attached code below. It can only insert a value to a linkedlist. Your goal is to add new functionality to the linkedlist. You may only choose 3 more functions: 1. getValue this function should be able to display a node by specifying its position (index). 2. clear resets the linkedlist by assigning null to head. 3. insertNewHead 4. InsertAt this function can be used to assign a new head to the linkedlist this function can be used to insert a node to a specific location. 5. displayAll this function will display all nodes import java.util.Scanner; class MainLL { public static void main(String[] args) { Scanner sc = new Scanner(System.in); SinglyLL sll new SinglyLL(); String msg="Enter an action: [1] Insert, [2]Get an element, [3] clear, [e]Exit"; System.out.println(msg); int choice sc.nextInt(); while(choice != 0) { switch(choice) ( case 1: System.out.println("Enter a value:"); sll.insert(sc.next()); System.out.println("Successfully added a node!\n" + msg); default System.out.println("Invalid input! Please try again.\n"+msg); break; break; } choice sc.nextInt();
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Direction: Continue the attached code below. It can only insert a value to a linkedlist.
Your goal is to add new functionality to the linkedlist. You may only choose 3 more functions:
1. getValue - this function should be able to display a node by specifying its position (index).
2. clear - resets the linkedlist by assigning null to head.
3. insertNewHead
this function can be used to assign a new head to the linkedlist
4. insertAt - this function can be used to insert a node to a specific location.
5. displayAll this function will display all nodes
import java.util.Scanner;
class MainLL
{
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
SinglyLL sll= new SinglyLL();
String msg = "Enter an action: [1] Insert, [2]Get an element, [3] clear, [0] Exit";
System.out.println(msg);
int choice = sc.nextInt();
while(choice != 0) {
switch(choice) {
case 1: System.out.println("Enter a value:");
System.out.println("Successfully added a node!\n" + msg);
default: System.out.println("Invalid input! Please try again. \n"+msg);
break;
break;
sll.insert(sc.next());
}
choice sc.nextInt();](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa7ac4e33-0b78-4b70-8ee3-82ff0fa4ed0b%2F719576ae-4572-48a2-91eb-f6a6adf3fe57%2Fzhzpz6c_processed.png&w=3840&q=75)
Transcribed Image Text:Direction: Continue the attached code below. It can only insert a value to a linkedlist.
Your goal is to add new functionality to the linkedlist. You may only choose 3 more functions:
1. getValue - this function should be able to display a node by specifying its position (index).
2. clear - resets the linkedlist by assigning null to head.
3. insertNewHead
this function can be used to assign a new head to the linkedlist
4. insertAt - this function can be used to insert a node to a specific location.
5. displayAll this function will display all nodes
import java.util.Scanner;
class MainLL
{
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
SinglyLL sll= new SinglyLL();
String msg = "Enter an action: [1] Insert, [2]Get an element, [3] clear, [0] Exit";
System.out.println(msg);
int choice = sc.nextInt();
while(choice != 0) {
switch(choice) {
case 1: System.out.println("Enter a value:");
System.out.println("Successfully added a node!\n" + msg);
default: System.out.println("Invalid input! Please try again. \n"+msg);
break;
break;
sll.insert(sc.next());
}
choice sc.nextInt();
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY