In the above program make the necessary changes so that a new struct, date, is defined for the expiration date of the product. Thus, an expiration date, day, month, and year, will be associated with each node. Use the following expiration dates for each item: Rolls 08/10/2003 Jam 09/12/2003 Tea 01/01/2010 #include #include #include using namespace std; struct Node { string item; int count; Node *link; }; typedef Node* NodePtr; void head_insert(NodePtr& head, string an_item, int a_number); void show_list(NodePtr& head); int main() { NodePtr head = NULL; head_insert(head, "Tea", 2); head_insert(head, "Jam", 3); head_insert(head, "Rolls", 10); show_list(head); return 0; } void head_insert(NodePtr& head, string an_item, int a_number) { NodePtr temp_ptr; temp_ptr = new Node; temp_ptr-> item = an_item; temp_ptr-> count = a_number; temp_ptr->link = head; head = temp_ptr; } void show_list(NodePtr& head) { NodePtr here = head; while (here != NULL) { cout << here-> item << "\t"; cout << here-> count << endl; here = here->link; } }

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...
icon
Related questions
Question
100%

Exercise 15.1
In the above program make the necessary changes so that a new struct, date, is defined for the expiration date of the
product. Thus, an expiration date, day, month, and year, will be associated with each node. Use the following expiration
dates for each item:
Rolls 08/10/2003
Jam 09/12/2003
Tea 01/01/2010

#include <iostream>
#include <cstddef>
#include <string>
using namespace std;
struct Node
{
string item;
int count;
Node *link;
};
typedef Node* NodePtr;
void head_insert(NodePtr& head, string an_item, int a_number);
void show_list(NodePtr& head);
int main()
{
NodePtr head = NULL;
head_insert(head, "Tea", 2);
head_insert(head, "Jam", 3);
head_insert(head, "Rolls", 10);
show_list(head);
return 0;
}

void head_insert(NodePtr& head, string an_item, int a_number)
{
NodePtr temp_ptr;
temp_ptr = new Node;
temp_ptr-> item = an_item;
temp_ptr-> count = a_number;
temp_ptr->link = head;
head = temp_ptr;
}
void show_list(NodePtr& head)
{
NodePtr here = head;
while (here != NULL)
{
cout << here-> item << "\t";
cout << here-> count << endl;
here = here->link;
}
}

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY