26. Given the definition of the classes Node and List above but with this new List public member function named mystery added, draw the memory diagram after all of the shown code in the main function executes (but before the main function ends). Be careful, there may be dangling pointers and/or memory leaks after calling the mystery function. Be sure to show these in your diagram. Circle ALL memory leaks. You may put ?? in a dangling pointer variable or just leave the arrow dangling in your drawing. Be sure to draw pointers in the same manner as I showed in lecture (arrow starts inside variable and ends at memory location it points to). void List:imyatery (int val) ( if (head nullptr) ( head - new Node (val): tail - head: int main() { List list: list.mystery (2) list.mystery (3) list.mystery (5): I else if (head->next nullptr) { head->next - new Node (val) } else ( Node *nl - new Node (val): nl->next - head->next: head->next - nl: // Draw what memory // looks like now // (Note: the main // function has not // yet ended) delete nli

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
Cs10 Quiz 1
6 / 7
100%
+
26. Given the definition of the classes Node and List above but with this new List public member
function named mystery added, draw the memory diagram after all of the shown code in the main
function executes (but before the main function ends). Be careful, there may be dangling pointers
and/or memory leaks after calling the mystery function. Be sure to show these in your diagram.
Circle ALL memory leaks. You may put ?? in a dangling pointer variable or just leave the arrow
dangling in your drawing. Be sure to draw pointers in the same manner as I showed in lecture (arrow
starts inside variable and ends at memory location it points to).
void List::mystery (int val) {
if (head == nullptr) {
head = new Node (val);
tail = head;
} else if (head->next == nullptr) {
head->next = new Node (val);
} else (
Node *nl = new Node (val);
int main () {
List list;
list.mystery (2);
list.mystery (3) ;
list.mystery (5);
// Draw what memory
// looks like now
// (Note: the main
nl->next = head->next;
= nl;
//
//
head-
func
not
delete nl;
yet ended)
Runtime-stack
Heap
Transcribed Image Text:Cs10 Quiz 1 6 / 7 100% + 26. Given the definition of the classes Node and List above but with this new List public member function named mystery added, draw the memory diagram after all of the shown code in the main function executes (but before the main function ends). Be careful, there may be dangling pointers and/or memory leaks after calling the mystery function. Be sure to show these in your diagram. Circle ALL memory leaks. You may put ?? in a dangling pointer variable or just leave the arrow dangling in your drawing. Be sure to draw pointers in the same manner as I showed in lecture (arrow starts inside variable and ends at memory location it points to). void List::mystery (int val) { if (head == nullptr) { head = new Node (val); tail = head; } else if (head->next == nullptr) { head->next = new Node (val); } else ( Node *nl = new Node (val); int main () { List list; list.mystery (2); list.mystery (3) ; list.mystery (5); // Draw what memory // looks like now // (Note: the main nl->next = head->next; = nl; // // head- func not delete nl; yet ended) Runtime-stack Heap
Expert Solution
trending now

Trending now

This is a popular 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