ItemNode.h:
#include <iostream>
#include <string>
using namespace std;
class ItemNode {
private:
string item;
ItemNode* nextNodeRef;
public:
// Constructor
ItemNode() {
item = "";
nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit) {
this->item = itemInit;
this->nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit, ItemNode *nextLoc) {
this->item = itemInit;
this->nextNodeRef = nextLoc;
}
// Insert node after this node.
void InsertAfter(ItemNode &nodeLoc) {
ItemNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = &nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Define InsertAtEnd() function that inserts a node
// to the end of the linked list
void InsertAtEnd(string item) {
ItemNode* newNode = new ItemNode(item);
if (nextNodeRef == NULL) {
nextNodeRef = newNode;
} else {
ItemNode* current = nextNodeRef;
while (current->nextNodeRef != NULL) {
current = current->nextNodeRef;
}
current->nextNodeRef = newNode;
}
}
// Get location pointed by nextNodeRef
ItemNode* GetNext() {
return this->nextNodeRef;
}
void PrintNodeData() {
cout << this->item << endl;
}
};
int main() {
int numItems;
cin >> numItems;
ItemNode head;
ItemNode* current = &head;
for (int i = 0; i < numItems; i++) {
string item;
cin >> item;
current->InsertAtEnd(item);
current = current->GetNext();
}
current = head.GetNext();
while (current != NULL) {
current->PrintNodeData();
current = current->GetNext();
}
return 0;
}
main.cpp (only for viewing)
#include "ItemNode.h"
int main() {
ItemNode *headNode; // Create intNode objects
ItemNode *currNode;
ItemNode *lastNode;
string item;
int i;
int input;
// Front of nodes list
headNode = new ItemNode();
lastNode = headNode;
cin >> input;
for (i = 0; i < input; i++) {
cin >> item;
currNode = new ItemNode(item);
lastNode->InsertAtEnd(currNode);
lastNode = currNode;
}
// Print linked list
currNode = headNode->GetNext();
while (currNode != NULL) {
currNode->PrintNodeData();
currNode = currNode->GetNext();
}
}
in c++ please. Thank you!
18.18 LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main0, define an
InsertAtEnd() member function 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: begin{tabular}{|l} hline 4 Kale Lettuce
Carrots Peanuts end{tabular} 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:.
Fostering Friendships - Enhancing Social Bonds in the Classroom
ItemNodeh include ltiostreamgt include ltstring.pdf
1. ItemNode.h:
#include <iostream>
#include <string>
using namespace std;
class ItemNode {
private:
string item;
ItemNode* nextNodeRef;
public:
// Constructor
ItemNode() {
item = "";
nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit) {
this->item = itemInit;
this->nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit, ItemNode *nextLoc) {
this->item = itemInit;
this->nextNodeRef = nextLoc;
}
// Insert node after this node.
void InsertAfter(ItemNode &nodeLoc) {
ItemNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = &nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Define InsertAtEnd() function that inserts a node
// to the end of the linked list
void InsertAtEnd(string item) {
ItemNode* newNode = new ItemNode(item);
if (nextNodeRef == NULL) {
nextNodeRef = newNode;
} else {
ItemNode* current = nextNodeRef;
while (current->nextNodeRef != NULL) {
current = current->nextNodeRef;
2. }
current->nextNodeRef = newNode;
}
}
// Get location pointed by nextNodeRef
ItemNode* GetNext() {
return this->nextNodeRef;
}
void PrintNodeData() {
cout << this->item << endl;
}
};
int main() {
int numItems;
cin >> numItems;
ItemNode head;
ItemNode* current = &head;
for (int i = 0; i < numItems; i++) {
string item;
cin >> item;
current->InsertAtEnd(item);
current = current->GetNext();
}
current = head.GetNext();
while (current != NULL) {
current->PrintNodeData();
current = current->GetNext();
}
return 0;
}
main.cpp (only for viewing)
#include "ItemNode.h"
int main() {
ItemNode *headNode; // Create intNode objects
ItemNode *currNode;
ItemNode *lastNode;
string item;
int i;
int input;
// Front of nodes list
headNode = new ItemNode();
lastNode = headNode;
3. cin >> input;
for (i = 0; i < input; i++) {
cin >> item;
currNode = new ItemNode(item);
lastNode->InsertAtEnd(currNode);
lastNode = currNode;
}
// Print linked list
currNode = headNode->GetNext();
while (currNode != NULL) {
currNode->PrintNodeData();
currNode = currNode->GetNext();
}
}
in c++ please. Thank you!
18.18 LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main0, define an
InsertAtEnd() member function 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: begin{tabular}{|l} hline 4 Kale Lettuce
Carrots Peanuts end{tabular} 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:
