Java Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts  where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts

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

Java

Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node.

Ex. if the input is:

4

Kale

Lettuce

Carrots

Peanuts 

where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list.

The output is:

Kale

Lettuce

Carrots

Peanuts 

Second image is ItemNode

1 import java.util.Scanner;
2
3 public class shoppingList {
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
1247891
25
26
30
31
32
33
34 }
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
ItemNode headNode; // Create intNode objects
ItemNode currNode;
ItemNode lastNode;
string item;
int i;
// Front of nodes List
headNode = new ItemNode();
lastNode = headNode;
int input = scnr.nextInt ();
for (i = 0; i <input; i++){
item scnr.next();
currNode = new ItemNode (item);
lastNode.insertAtEnd (headNode, currNode);
lastNode = currNode;
}
// Print Linked List
currNode = headNode.getNext();
while (currNode != null) {
currNode.printNodeData();
currNode = currNode.getNext();
Don't Edit This One
This is just the class
Transcribed Image Text:1 import java.util.Scanner; 2 3 public class shoppingList { 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 1247891 25 26 30 31 32 33 34 } public static void main (String[] args) { Scanner scnr = new Scanner(System.in); ItemNode headNode; // Create intNode objects ItemNode currNode; ItemNode lastNode; string item; int i; // Front of nodes List headNode = new ItemNode(); lastNode = headNode; int input = scnr.nextInt (); for (i = 0; i <input; i++){ item scnr.next(); currNode = new ItemNode (item); lastNode.insertAtEnd (headNode, currNode); lastNode = currNode; } // Print Linked List currNode = headNode.getNext(); while (currNode != null) { currNode.printNodeData(); currNode = currNode.getNext(); Don't Edit This One This is just the class
1 public class ItemNode {
private string item;
private ItemNode nextNodeRef; // Reference to the next node
N34567
2
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43 }
public ItemNode() {
item = "";
nextNodeRef = null;
}
// Constructor
public ItemNode(String itemInit) {
iteminit;
this.item
this.nextNodeRef = null;
}
// Constructor
public ItemNode(String itemInit, ItemNode nextLoc) {
this.item
itemInit;
this.nextNodeRef = nextLoc;
}
// Insert node after this node.
public void insertAfter (ItemNode nodeLoc) {
ItemNode tmpNext;
tmpNext = this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
// TODO: Define insertAtEnd() method that inserts a node
to the end of the linked List
}
// Get Location pointed by nextNodeRef
public ItemNode getNext() {
return this.nextNodeRef;
}
public void printNodeData() {
System.out.println(this.item);
Transcribed Image Text:1 public class ItemNode { private string item; private ItemNode nextNodeRef; // Reference to the next node N34567 2 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 } public ItemNode() { item = ""; nextNodeRef = null; } // Constructor public ItemNode(String itemInit) { iteminit; this.item this.nextNodeRef = null; } // Constructor public ItemNode(String itemInit, ItemNode nextLoc) { this.item itemInit; this.nextNodeRef = nextLoc; } // Insert node after this node. public void insertAfter (ItemNode nodeLoc) { ItemNode tmpNext; tmpNext = this.nextNodeRef; this.nextNodeRef = nodeLoc; nodeLoc.nextNodeRef = tmpNext; // TODO: Define insertAtEnd() method that inserts a node to the end of the linked List } // Get Location pointed by nextNodeRef public ItemNode getNext() { return this.nextNodeRef; } public void printNodeData() { System.out.println(this.item);
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Operations of Linked List
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