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 public class ItemNode { private String item; private ItemNode nextNodeRef; // Reference to the next node public ItemNode() { item = ""; nextNodeRef = null; } // Constructor public ItemNode(String itemInit) { this.item = itemInit; 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); } }

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 public class ItemNode { private String item; private ItemNode nextNodeRef; // Reference to the next node public ItemNode() { item = ""; nextNodeRef = null; } // Constructor public ItemNode(String itemInit) { this.item = itemInit; 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); } }

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

Related questions

Question

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

public class ItemNode {
private String item;
private ItemNode nextNodeRef; // Reference to the next node

public ItemNode() {
item = "";
nextNodeRef = null;
}

// Constructor
public ItemNode(String itemInit) {
this.item = itemInit;
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);
}
}

19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34 }
}
for (i = 0; i <input;i++){
item= scnr.next();
currNode = new ItemNode (item);
lastNode.insertAt End (headNode, currNode);
lastNode currNode;
}
// Print Linked List
currNode
while (currNode != null) {
currNode.printNodeData();
}
headNode.getNext();
currNode= currNode.getNext ();

File is marked as read only
1 import java.util.Scanner;
3 public class ShoppingList {
IN35∞ H
2
4
6
7
8
9
10 |
11
12
13
14
15
16
17
18
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;
Current file: ShoppingList.java ❤
// Front of nodes List
headNode = new ItemNode();
lastNode headNode;
int input = scnr.nextInt():

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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