8.14 LAB: Mileage tracker for a runner Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. DO NOT print the dummy head node.Ex. If the input is:32.27/2/183.27/7/184.57/16/18the output is:2.2, 7/2/183.2, 7/7/184.5, 7/16/18 Main.cpp#include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std;int main (int argc, char* argv[]) {// References for MileageTrackerNode objectsMileageTrackerNode* headNode;MileageTrackerNode* currNode;MileageTrackerNode* lastNode;double miles;string date;int i;// Front of nodes listheadNode = new MileageTrackerNode();lastNode = headNode;// TODO: Read in the number of nodes// TODO: For the read in number of nodes, read// in data and insert into the linked list// TODO: Call the PrintNodeData() method// to print the entire linked list// MileageTrackerNode Destructor deletes all// following nodesdelete headNode;} File is marked as read onlyCurrent file: MileageTrackerNode.h -1 #ifndef MILEAGETRACKERNODEH2 #define MILEAGETRACKERNODEH34 #include 5 using namespace std;6.7 class MileageTrackerNode {public:// ConstructorMileageTrackerNode();8.9.1011// Destructor-MileageTrackerNode();121314// ConstructorMileageTrackerNode(double milesInit, string dateInit);151617// ConstructorMileageTrackerNode(double milesInit, string dateInit, MileageTrackerNode* nextLoc);18192021/* Insert node after this node.22Before: thisnext23After:thisnodenext--24*/25void InsertAfter(MileageTrackerNode* nodeLoc);26// Get location pointed by nextNodeRefMileageTrackerNode* GetNext();27282930void PrintNodeData();31private:double miles;string date;MileageTrackerNode* nextNodeRef; // Reference to the next node32// Node data// Node data33343536 };37 File is marked as read onlyCurrent file: MileageTrackerNode.cpp1 #include "MileageTrackerNode.h"2 #include 34 // Constructor5 MileageTrackerNode::MileageTrackerNode() {6.miles = 0.0;date = "".nextNodeRef =78nullptr;9 }1011 // Destructor12 MileageTrackerNode::-MileageTrackerNode() {if(nextNodeRef != nullptr) {delete nextNodeRef;1314}16 }151718 // Constructor19 MileageTrackerNode::MileageTrackerNode(double milesInit, string dateInit) {miles = milesInit;date = dateInit;nextNodeRef = nullptr;20212223 }2425 // Constructor26 MileageTrackerNode::MileageTrackerNode(double milesInit, string dateInit, MileageTrackerNode* nextLoc) {miles = milesInit;date = dateInit;nextNodeRef = nextLoc;27282930 }3132 /* Insert node after this node.33 Before: thisthis --next34 After:nodenext--35 */36 void MileageTrackerNode::InsertAfter(MileageTrackerNode* nodeloc) {37MileageTrackerNode* tmpNext;38tmpNext = nextNodeRef;nextNodeRef =3940nodeloc;41nodeLoc->nextNodeRef = tmpNext;42 }4344 // Get location pointed by nextNodeRef45 MileageTrackerNode* MileageTrackerNode::GetNext() {46return nextNodeRef;47 }4849 void MileageTrackerNode::PrintNodeData(){<« date << endl;50cout << miles << "51 }

Required C++ code according to the syntax provided below along with the screenshot of sample output

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

8.14 LAB: Mileage tracker for a runner

Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. DO NOT print the dummy head node.

Ex. If the input is:

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

Main.cpp

#include "MileageTrackerNode.h"
#include <string>
#include <iostream>
using namespace std;

int main (int argc, char* argv[]) {
// References for MileageTrackerNode objects
MileageTrackerNode* headNode;
MileageTrackerNode* currNode;
MileageTrackerNode* lastNode;

double miles;
string date;
int i;

// Front of nodes list
headNode = new MileageTrackerNode();
lastNode = headNode;

// TODO: Read in the number of nodes

// TODO: For the read in number of nodes, read
// in data and insert into the linked list

// TODO: Call the PrintNodeData() method
// to print the entire linked list

// MileageTrackerNode Destructor deletes all
// following nodes
delete headNode;
}

File is marked as read only
Current file: MileageTrackerNode.h -
1 #ifndef MILEAGETRACKERNODEH
2 #define MILEAGETRACKERNODEH
3
4 #include <string>
5 using namespace std;
6.
7 class MileageTrackerNode {
public:
// Constructor
MileageTrackerNode();
8.
9.
10
11
// Destructor
-MileageTrackerNode();
12
13
14
// Constructor
MileageTrackerNode(double milesInit, string dateInit);
15
16
17
// Constructor
MileageTrackerNode(double milesInit, string dateInit, MileageTrackerNode* nextLoc);
18
19
20
21
/* Insert node after this node.
22
Before: this
next
23
After:
this
node
next
--
24
*/
25
void InsertAfter(MileageTrackerNode* nodeLoc);
26
// Get location pointed by nextNodeRef
MileageTrackerNode* GetNext();
27
28
29
30
void PrintNodeData();
31
private:
double miles;
string date;
MileageTrackerNode* nextNodeRef; // Reference to the next node
32
// Node data
// Node data
33
34
35
36 };
37

File is marked as read only
Current file: MileageTrackerNode.cpp
1 #include "MileageTrackerNode.h"
2 #include <iostream>
3
4 // Constructor
5 MileageTrackerNode::MileageTrackerNode() {
6.
miles = 0.0;
date = "".
nextNodeRef =
7
8
nullptr;
9 }
10
11 // Destructor
12 MileageTrackerNode::-MileageTrackerNode() {
if(nextNodeRef != nullptr) {
delete nextNodeRef;
13
14
}
16 }
15
17
18 // Constructor
19 MileageTrackerNode::MileageTrackerNode(double milesInit, string dateInit) {
miles = milesInit;
date = dateInit;
nextNodeRef = nullptr;
20
21
22
23 }
24
25 // Constructor
26 MileageTrackerNode::MileageTrackerNode(double milesInit, string dateInit, MileageTrackerNode* nextLoc) {
miles = milesInit;
date = dateInit;
nextNodeRef = nextLoc;
27
28
29
30 }
31
32 /* Insert node after this node.
33 Before: this
this --
next
34 After:
node
next
--
35 */
36 void MileageTrackerNode::InsertAfter(MileageTrackerNode* nodeloc) {
37
MileageTrackerNode* tmpNext;
38
tmpNext = nextNodeRef;
nextNodeRef =
39
40
nodeloc;
41
nodeLoc->nextNodeRef = tmpNext;
42 }
43
44 // Get location pointed by nextNodeRef
45 MileageTrackerNode* MileageTrackerNode::GetNext() {
46
return nextNodeRef;
47 }
48
49 void MileageTrackerNode::PrintNodeData(){
<« date << endl;
50
cout << miles << "
51 }

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

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.