Given main() in the Inventory class, define an insertAtFront() method in the InventoryNode class that inserts items at the front of a linked list (after the dummy head node). Ex. If the input is: plates 100 spoons 200 cups 150 forks 200 the output is: 200 forks 150 cups 200 spoons 100 plates
Given main() in the Inventory class, define an insertAtFront() method in the InventoryNode class that inserts items at the front of a linked list (after the dummy head node). Ex. If the input is: plates 100 spoons 200 cups 150 forks 200 the output is: 200 forks 150 cups 200 spoons 100 plates
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
Java
Given main() in the Inventory class, define an insertAtFront() method in the InventoryNode class that inserts items at the front of a linked list (after the dummy head node).
![1 import java.util.Scanner;
2
3 public class Inventory {
4 public static void main (String[] args) {
5
Scanner scnr = new Scanner(System.in);
6
7
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
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
InventoryNode headNode;
InventoryNode currNode;
InventoryNode lastNode;
string item;
int numberOfItems;
int i;
// Front of nodes List
headNode new InventoryNode();
lastNode headNode;
int input
for(i=0; i<input; i++) {
item scnr.next();
}
scnr.nextInt();
}
// Print Linked List
currNode
}
numberOfItems = scnr.nextInt();
currNode = new InventoryNode(item, numberofitems);
currNode.insertAtFront (headNode, currNode);
lastNode= currNode;
1 public class InventoryNode {
2 private string item;
3 private int number of Items;
4 private InventoryNode nextNodeRef; // Reference to the next node
headNode.getNext();
while (currNode != null) {
currNode.printNodeData();
currNode= currNode.getNext();
public InventoryNode() {
item = "";
numberOfItems = 0;
nextNodeRef = null;
}
// Constructor
public InventoryNode (string itemInit, int numberOfItemsInit) {
this.item
itemInit;
this.numberOfItems = numberofitemsInit;
this.nextNodeRef = null;
}
// Constructor
public InventoryNode (String itemInit, int numberOfItemsInit, InventoryNode nextLoc) {
this.item=itemInit;
Read Only
this.numberOf Items = numberOfItemsInit;
this.nextNodeRef = nextLoc;
}
// TODO: Define an insertAtFront () method that inserts a node at the
front of the Linked List (after the dummy head node)
29
30
31
32
33
}
34
35
// Print node data
36 public void printNodeData() {
37
38
39}
// Get Location pointed by nextNodeRef
public InventoryNode getNext() {
return this.nextNodeRef;
System.out.println(this.numberofitems +
"+this.item);](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1c870776-4927-4fbd-b218-f5b27740c439%2Fc3ce9c47-ddca-42d4-8ed8-303600bb2f85%2F718h3e_processed.png&w=3840&q=75)
Transcribed Image Text:1 import java.util.Scanner;
2
3 public class Inventory {
4 public static void main (String[] args) {
5
Scanner scnr = new Scanner(System.in);
6
7
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
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
InventoryNode headNode;
InventoryNode currNode;
InventoryNode lastNode;
string item;
int numberOfItems;
int i;
// Front of nodes List
headNode new InventoryNode();
lastNode headNode;
int input
for(i=0; i<input; i++) {
item scnr.next();
}
scnr.nextInt();
}
// Print Linked List
currNode
}
numberOfItems = scnr.nextInt();
currNode = new InventoryNode(item, numberofitems);
currNode.insertAtFront (headNode, currNode);
lastNode= currNode;
1 public class InventoryNode {
2 private string item;
3 private int number of Items;
4 private InventoryNode nextNodeRef; // Reference to the next node
headNode.getNext();
while (currNode != null) {
currNode.printNodeData();
currNode= currNode.getNext();
public InventoryNode() {
item = "";
numberOfItems = 0;
nextNodeRef = null;
}
// Constructor
public InventoryNode (string itemInit, int numberOfItemsInit) {
this.item
itemInit;
this.numberOfItems = numberofitemsInit;
this.nextNodeRef = null;
}
// Constructor
public InventoryNode (String itemInit, int numberOfItemsInit, InventoryNode nextLoc) {
this.item=itemInit;
Read Only
this.numberOf Items = numberOfItemsInit;
this.nextNodeRef = nextLoc;
}
// TODO: Define an insertAtFront () method that inserts a node at the
front of the Linked List (after the dummy head node)
29
30
31
32
33
}
34
35
// Print node data
36 public void printNodeData() {
37
38
39}
// Get Location pointed by nextNodeRef
public InventoryNode getNext() {
return this.nextNodeRef;
System.out.println(this.numberofitems +
"+this.item);
Transcribed Image Text:Given main() in the Inventory class, define an insertAtFront() method in the InventoryNode class that inserts items at the front of a
linked list (after the dummy head node).
Ex. If the input is:
4
plates 100
spoons 200
cups 150
forks 200
the output is:
200 forks
150 cups
200 spoons
100 plates
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
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