Given the MileageTrackerNode class, complete main() in the MileageTracker LinkedList class to insert nodes into a linked list (using the insertAfter() method). The first user-input value is the number of nodes in the linked list. Use the printNodeData() method to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 1 import java.util.Scanner; 2 3 public class MileageTrackerLinked List { 4 5 6 7 8 9 25 26 27 28 29 30 } 8 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 File is marked as read only } public static void main (string[] args) { Scanner scnr new Scanner(System.in); double miles; string date; int i; // References for MileageTrackerNode objects MileageTracker Node headNode; MileageTrackerNode currNode; MileageTrackerNode lastNode; } 1 public class MileageTrackerNode { 2 private double miles; // Node data 3 private String date; // Node data 4 private MileageTrackerNode nextNodeRef; // Reference to the next node 5 // Front of nodes List headNode new MileageTrackerNode(); lastNode headNode; // TODO: Scan the number of nodes // TODO: For the scanned number of nodes, scan in data and insert into the Linked List public MileageTrackerNode() { miles = 0.0; date = ""; nextNodeRef = null; Current file: // TODO: CALL the printNodeData() method to print the entire Linked List Mileage Tracker LinkedList.java this.miles this.date= dateInit; this.nextNodeRef = null; Current file: // Constructor public MileageTracker Node (double milesInit, String dateInit) { milesInit; } /* Insert node after this node. Before: this next After: this node next MileageTrackerNode.java // Constructor public MileageTracker Node (double milesInit, String dateInit, MileageTrackerNode nextLoc) { this.niles milesInit; this.date dateInit; this.nextNodeRef nextLoc; tmpNext = this.nextNodeRef; this.nextNodeRef = nodeLoc; nodeLoc.nextNodeRef = tmpNext; } // Get Location pointed by nextNodeRef public MileageTrackerNode getNext() { return this.nextNodeRef; } public void insertAfter (MileageTrackerNode nodeLoc) { MileageTrackerNode tapNext; public void printNodeData() { System.out.println(this.miles +". + this.date); Load default template...
Given the MileageTrackerNode class, complete main() in the MileageTracker LinkedList class to insert nodes into a linked list (using the insertAfter() method). The first user-input value is the number of nodes in the linked list. Use the printNodeData() method to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 1 import java.util.Scanner; 2 3 public class MileageTrackerLinked List { 4 5 6 7 8 9 25 26 27 28 29 30 } 8 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 File is marked as read only } public static void main (string[] args) { Scanner scnr new Scanner(System.in); double miles; string date; int i; // References for MileageTrackerNode objects MileageTracker Node headNode; MileageTrackerNode currNode; MileageTrackerNode lastNode; } 1 public class MileageTrackerNode { 2 private double miles; // Node data 3 private String date; // Node data 4 private MileageTrackerNode nextNodeRef; // Reference to the next node 5 // Front of nodes List headNode new MileageTrackerNode(); lastNode headNode; // TODO: Scan the number of nodes // TODO: For the scanned number of nodes, scan in data and insert into the Linked List public MileageTrackerNode() { miles = 0.0; date = ""; nextNodeRef = null; Current file: // TODO: CALL the printNodeData() method to print the entire Linked List Mileage Tracker LinkedList.java this.miles this.date= dateInit; this.nextNodeRef = null; Current file: // Constructor public MileageTracker Node (double milesInit, String dateInit) { milesInit; } /* Insert node after this node. Before: this next After: this node next MileageTrackerNode.java // Constructor public MileageTracker Node (double milesInit, String dateInit, MileageTrackerNode nextLoc) { this.niles milesInit; this.date dateInit; this.nextNodeRef nextLoc; tmpNext = this.nextNodeRef; this.nextNodeRef = nodeLoc; nodeLoc.nextNodeRef = tmpNext; } // Get Location pointed by nextNodeRef public MileageTrackerNode getNext() { return this.nextNodeRef; } public void insertAfter (MileageTrackerNode nodeLoc) { MileageTrackerNode tapNext; public void printNodeData() { System.out.println(this.miles +". + this.date); Load default template...
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
Related questions
Question
Java - Mileage for a Runner
![Given the MileageTrackerNode class, complete main() in the MileageTracker Linked List class to insert nodes into a linked list (using
the insertAfter() method). The first user-input value is the number of nodes in the linked list. Use the printNodeData() method to print the
entire linked list. DO NOT print the dummy head node.
Ex. If the input is:
3
2.2
7/2/18
3.2
7/7/18
4.5
7/16/18
the output is:
2.2, 7/2/18
3.2, 7/7/18
4.5, 7/16/18
5
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 }
7
8
9
10
11
12
1 import java.util.Scanner;
2
3 public class MileageTrackerLinkedList {
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
4
File is marked as read only
15
16
17
18
19
20
21
22
23
24
25
26
31
32
33
34
35
36
37
1 public class MileageTrackerNode {
2
private double miles;
3
private String date;
4 private MileageTrackerNode nextNodeRef; // Reference to the next node
5
6
38
39
40
41
42
43
44
}
double miles;
string date;
int i;
// References for MileageTrackerNode objects
MileageTracker Node headNode;
MileageTracker Node currNode;
MileageTracker Node lastNode;
}
public MileageTracker Node() {
0.0;
// Front of nodes List
headNode = new MileageTrackerNode();
lastNode headNode;
// TODO: Scan the number of nodes
// TODO: For the scanned number of nodes, scan
//
in data and insert into the Linked List
// Constructor
13 public MileageTrackerNode (double milesInit, String dateInit) {
14
// TODO: CALL the printNodeData() method
to print the entire Linked List
27 Before: this
28
29
30
miles
date = "";
nextNodeRef = null;
Current
file:
this.miles
milesInit;
this.date dateInit;
this.nextNodeRef = null;
}
}
/* Insert node after this node.
next
MileageTrackerLinkedList.java
Current
file:
After: this node next
// Node data
// Node data
// Constructor
public MileageTracker Node (double milesInit, String dateInit, MileageTrackerNode nextLoc) {
this.miles= milesInit;
this.date dateInit;
this.nextNodeRef = nextLoc;
MileageTracker Node.java
tmpNext this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Get Location pointed by nextNodeRef
public MileageTrackerNode getNext() {
return this.nextNodeRef;
public void insertAfter (MileageTrackerNode nodeLoc) {
MileageTracker Node tmpNext;
public void printNodeData() {
System.out.println(this.miles + ", " + this.date);
Load default template...](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1c870776-4927-4fbd-b218-f5b27740c439%2F62fc24ef-b917-42a9-a556-91a91716db02%2Fsr86mj_processed.png&w=3840&q=75)
Transcribed Image Text:Given the MileageTrackerNode class, complete main() in the MileageTracker Linked List class to insert nodes into a linked list (using
the insertAfter() method). The first user-input value is the number of nodes in the linked list. Use the printNodeData() method to print the
entire linked list. DO NOT print the dummy head node.
Ex. If the input is:
3
2.2
7/2/18
3.2
7/7/18
4.5
7/16/18
the output is:
2.2, 7/2/18
3.2, 7/7/18
4.5, 7/16/18
5
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 }
7
8
9
10
11
12
1 import java.util.Scanner;
2
3 public class MileageTrackerLinkedList {
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
4
File is marked as read only
15
16
17
18
19
20
21
22
23
24
25
26
31
32
33
34
35
36
37
1 public class MileageTrackerNode {
2
private double miles;
3
private String date;
4 private MileageTrackerNode nextNodeRef; // Reference to the next node
5
6
38
39
40
41
42
43
44
}
double miles;
string date;
int i;
// References for MileageTrackerNode objects
MileageTracker Node headNode;
MileageTracker Node currNode;
MileageTracker Node lastNode;
}
public MileageTracker Node() {
0.0;
// Front of nodes List
headNode = new MileageTrackerNode();
lastNode headNode;
// TODO: Scan the number of nodes
// TODO: For the scanned number of nodes, scan
//
in data and insert into the Linked List
// Constructor
13 public MileageTrackerNode (double milesInit, String dateInit) {
14
// TODO: CALL the printNodeData() method
to print the entire Linked List
27 Before: this
28
29
30
miles
date = "";
nextNodeRef = null;
Current
file:
this.miles
milesInit;
this.date dateInit;
this.nextNodeRef = null;
}
}
/* Insert node after this node.
next
MileageTrackerLinkedList.java
Current
file:
After: this node next
// Node data
// Node data
// Constructor
public MileageTracker Node (double milesInit, String dateInit, MileageTrackerNode nextLoc) {
this.miles= milesInit;
this.date dateInit;
this.nextNodeRef = nextLoc;
MileageTracker Node.java
tmpNext this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Get Location pointed by nextNodeRef
public MileageTrackerNode getNext() {
return this.nextNodeRef;
public void insertAfter (MileageTrackerNode nodeLoc) {
MileageTracker Node tmpNext;
public void printNodeData() {
System.out.println(this.miles + ", " + this.date);
Load default template...
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 4 steps with 5 images
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education