Task 11: The following program is supposed to allocate nodes, put them into a linked list, print them out and then destroy them.Fix the bugs in the program and rewrite the code.Your program should have complete implementation required to run the following function.Take dummy data execute it, take snap shot and paste it in the document. struct linkedList { int number; linkedList* next; }; void AddNode() { linkedList* head = NULL; linkedList* current; for (int į = 0; i<10; į++) { current = new linkedList; current->number = i; current.next = head; head = current; } while (head->next != NULL) { cout << head->number << endl; current = head->next; delete current; head = current; } return 0;

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
Task 11:
The following program is supposed to allocate nodes, put them into a linked list, print them
out and then destroy them.Fix the bugs in the program and rewrite the code.Your program
should have complete implementation required to run the following function.Take dummy
data execute it, take snap shot and paste it in the document.
struct linkedList
{
int number;
linkedList* next;
};
void AddNodel)
{
linkedlist* head = NULL;
linkedList* current;
for (int į = 0; i<10; į++)
{
current = new linkedList;
current->number = i;
current.next = head;
head = current;
}
while (head->next != NULL)
{
cout << head->number << endl;
current = head->next;
delete current;
head = current;
}
return 0;
}
Transcribed Image Text:Task 11: The following program is supposed to allocate nodes, put them into a linked list, print them out and then destroy them.Fix the bugs in the program and rewrite the code.Your program should have complete implementation required to run the following function.Take dummy data execute it, take snap shot and paste it in the document. struct linkedList { int number; linkedList* next; }; void AddNodel) { linkedlist* head = NULL; linkedList* current; for (int į = 0; i<10; į++) { current = new linkedList; current->number = i; current.next = head; head = current; } while (head->next != NULL) { cout << head->number << endl; current = head->next; delete current; head = current; } return 0; }
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

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