25. Given the definitions of the classes Node and List below, define the member function insert_after and the destructor. The member function insert_after passes in the address to a Node (Node pointer) currently in the list and an integer value to be inserted into the list. This function should then create a new Node containing this integer value passed in and insert it into the list after the Node whose address is passed in. If the address passed in is 0, then insert the new Node at the front of the List. The insert_after function is a private helper function that will be used within the insert_sorted public member function. You DO NOT need to define the insert_sorted function. The destructor should ensure there are no memory leaks. Notice there are no push_front, push_back or pop_front functions declared or defined for this List class. You may NOT define these or any other member functions, even as private helper functions. struct Node { public: class List { private: Node *next; Node *head; int data; Node (int val) : next (0), data (val) Node *tail; public: List () : head (0), tail (0) {} -List (); //IMPLEMENT void insert sorted (int); //DON'T IMPLEMENT private: void insert_after (Node *, int); //IMPLEMENT {} } ; } ; 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); int main () { List list; list.mystery (2); list.mystery (3); list.mystery (5); tail - head; } else if (head->next == nullptr) { head->next = new Node (val); } else { Node *nl = new Node (val); // Draw what memory // looks like now // (Note: the main // nl->next = head->next; head->next = nl; function has not delete nl; // yet ended) } Runtime-stack Heap
25. Given the definitions of the classes Node and List below, define the member function insert_after and the destructor. The member function insert_after passes in the address to a Node (Node pointer) currently in the list and an integer value to be inserted into the list. This function should then create a new Node containing this integer value passed in and insert it into the list after the Node whose address is passed in. If the address passed in is 0, then insert the new Node at the front of the List. The insert_after function is a private helper function that will be used within the insert_sorted public member function. You DO NOT need to define the insert_sorted function. The destructor should ensure there are no memory leaks. Notice there are no push_front, push_back or pop_front functions declared or defined for this List class. You may NOT define these or any other member functions, even as private helper functions. struct Node { public: class List { private: Node *next; Node *head; int data; Node (int val) : next (0), data (val) Node *tail; public: List () : head (0), tail (0) {} -List (); //IMPLEMENT void insert sorted (int); //DON'T IMPLEMENT private: void insert_after (Node *, int); //IMPLEMENT {} } ; } ; 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); int main () { List list; list.mystery (2); list.mystery (3); list.mystery (5); tail - head; } else if (head->next == nullptr) { head->next = new Node (val); } else { Node *nl = new Node (val); // Draw what memory // looks like now // (Note: the main // nl->next = head->next; head->next = nl; function has not delete nl; // yet ended) } Runtime-stack Heap
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...
Related questions
Question
Please answer and give an explanation for both questions in the images.
Transcribed Image Text:25. Given the definitions of the classes Node and List below, define the member function
insert_after and the destructor.
The member function insert_after passes in the address to a Node (Node pointer) currently in
the list and an integer value to be inserted into the list. This function should then create a new Node
containing this integer value passed in and insert it into the list after the Node whose address is
passed in. If the address passed in is 0, then insert the new Node at the front of the List.
The insert_after function is a private helper function that will be used within the
insert_sorted public member function. You DO NOT need to define the insert_sorted
function.
The destructor should ensure there are no memory leaks.
Notice there are no push_front, push_back or pop_front functions declared or defined for
this List class. You may NOT define these or any other member functions, even as private helper
functions.
struct Node {
public:
class List {
private:
Node *next;
Node *head;
int data;
Node (int val)
: next (0), data (val)
Node *tail;
public:
List () : head (0), tail (0) {}
-List (); //IMPLEMENT
void insert sorted (int); //DON'T IMPLEMENT
private:
void insert_after (Node *, int); //IMPLEMENT
{}
} ;
} ;
Transcribed Image Text: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);
int main () {
List list;
list.mystery (2);
list.mystery (3);
list.mystery (5);
tail - head;
} else if (head->next == nullptr) {
head->next = new Node (val);
} else {
Node *nl = new Node (val);
// Draw what memory
// looks like now
// (Note: the main
//
nl->next = head->next;
head->next = nl;
function has not
delete nl;
// yet ended)
}
Runtime-stack
Heap
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY