HELP!!!!! with this data structure question **Instructions for Building a Linked List Using the Node Class**1. **Prompt the User for Input:** - Instruct the user to enter as many names as they desire.2. **Construct the Linked List:** - Use the `Node` class described below to build your linked list. - Ensure that the order of the list corresponds to the order of entry.3. **Node Class Structure:**```javapublic class Node{ public String data; public Node next = null; public Node(String data, Node next) { this.data = data; this.next = next; } public Node(String data) { this(data, null); } public String toString() { return data; }}```4. **Display the List:** - Print the entire list to show all the entered names.5. **Modify the List:** - Ask the user which name they wish to remove. - Remove the specified node from the list.This guide details the process of building a simple linked list in Java, involving node creation, list manipulation, and user interaction for dynamic list modifications.

Here, you need to build linked list by taking user inputs for node data. After building linked list, you need to delete that node which is provided by user from it. So, to build linked list, you need to write one function which will add nodes to list object. To delete node, you need to write delete function. In that function, you can traverse list and you can search the node. If node will found then you need to change links of that node. So that node will be deleted. To print list, you can write separate function. In that unction, you can traverse the list and you can print data of each node. To take user input, you need to use 'Scanner' class. So code will be like import java.util.Scanner; class Node{ public String data; public Node next = null; public Node(String data, Node next) { this.data = data; this.next = next; } public Node(String data) { this(data, null); } public String toString() { return data; }}public class Main{ Node head; // this function will print the list public static void printList(Main list) { Node currNode = list.head; System.out.print("\nLinkedList: "); while (currNode != null) { System.out.print(currNode.data + " "); currNode = currNode.next; } } // this function will delete the node public static Main deleteNode(Main list, String key) { Node currNode = list.head; Node prev = null; // this condition will get executed if head will be the node that needs to be deleted if (currNode != null && key.equalsIgnoreCase(currNode.data)) { list.head = currNode.next; System.out.println(key + " found and deleted"); return list; } // this loop will traverse ths link list while (currNode != null && !key.equalsIgnoreCase(currNode.data)) { prev = currNode; currNode = currNode.next; } if (currNode != null) { prev.next = currNode.next; System.out.println(key + " found and deleted"); } if (currNode == null) { System.out.println(key + " not found"); } return list; } // this function will add node in list public static Main insert(Main list, String data) { Node newNode = new Node(data); newNode.next = null; if (list.head == null) { list.head = newNode; } else { Node last = list.head; while (last.next != null) { last = last.next; } last.next = newNode; } return list; } public static void main(String[] args) { Main list = new Main(); // this is list object Scanner sc = new Scanner(System.in); // here Scanner class object is created while(true) { System.out.print("\nEnter name: "); String data = sc.nextLine(); list = insert(list, data); System.out.println("\nTo continue press 'Y' or to stop press 'N' "); String replay = sc.nextLine(); if(replay.equalsIgnoreCase("N")) { break; } } printList(list); System.out.print("\n\nWhich name do you want to remove: "); String name = sc.nextLine(); list = deleteNode(list, name); printList(list); }}Output of code is

Engineering

Computer Science

Ask user to enter as many names as he/she wants. Then according to the Node class below to build your link list. The order of list is according to the entering order. public class Node { public String data; public Node next = null; public Node(String data, Node next) { this.data = this.next = next; } public Node(String data) { this (data, null); } public String toString() { return data; } data; } Print the list. Ask user whom he/she wants to remove. Remove the node.

Ask user to enter as many names as he/she wants. Then according to the Node class below to build your link list. The order of list is according to the entering order. public class Node { public String data; public Node next = null; public Node(String data, Node next) { this.data = this.next = next; } public Node(String data) { this (data, null); } public String toString() { return data; } data; } Print the list. Ask user whom he/she wants to remove. Remove the node.

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

How does Blazor operate, in other words? What sets Razor apart from competing software? It's thought that Blazor can produce user interface elements in C# and.NET rather than JavaScript. What are the benefits and drawbacks of this arrangement in your opinion as a result?
How does Blazor work? What sets Razor apart from similar applications that are available? Blazor is said to be capable of generating user interface components in C# and.NET, as opposed to utilizing JavaScript as the programming language. As a direct result of this, in your perspective, what are some of the positives and negatives associated with being in this situation?
While working with Java, what are some benefits of encapsulating data? a11
Explore the concept of data binding expressions in ASP.NET and provide examples of their usage in web applications.
Assume you are in charge of compiling the information from books. Either more books should be placed on the shelf, or the books already on one side of the shelf should be removed. Choose and explain the best data structure for this situation. Give a flexible answer on how to add books to the shelf. What happens when a data structure has to be updated with new information but has insufficient space?
Review Concepts for VB.net: 1. How do you populate an array of structures? 2. How are functions created? 3. What does a function header look like?
What is the mechanism through which Blazor works? What distinguishes Razor from similar applications? Blazor is reported to be able to generate user interface components in C# and.NET rather than coding in JavaScript. What, in your opinion, are the advantages and disadvantages of this situation?
How does Blazor function? What sets Razor apart from other programs? Blazor is said to be capable of generating user interface components in C# and.NET rather than utilizing JavaScript as the programming language. As a result, what are the benefits and drawbacks of this situation, in your opinion?
What are your opinions on the encapsulation of data, if you don't mind my asking? Elaborate.
“object-oriented programming composition”. Explain the concept of Composition in your own words. Explain it so that you classmates can understand this important OOP concept. Provide examples.
Assume you are in charge of compiling the information from books. Either more books should be placed on the shelf, or the books already on one side of the shelf should be removed. Choose and explain the best data structure for this situation. Give a flexible answer on how to add books to the shelf. What happens when a data structure has to be updated with new information but has insufficient space?
Assume you are in charge of compiling the information from books. Either more books should be placed on the shelf, or the books already on one side of the shelf should be removed. Choose and explain the best data structure for this situation. Give a flexible answer on how to add books to the shelf. What happens when a data structure has to be updated with new information but has insufficient space?