Your Name: TA\'s Name: 6. (15 pts) Write a destroyList () member function for th

ID: 3730221 • Letter: Y

Question

Your Name: TA's Name: 6. (15 pts) Write a destroyList () member function for the class List (dynamically linked) that does not accept any arguments and does not return a value. This function should iteratively (using just a loop, not recursion) remove every Node in the list and set the head pointer back to NULL. Given: a class ListNode with the following private data members: ListNode "mpNext; int mData; and a class List with the following private data member: ListNode mpHead; and the class List is a friend of class ListNode. The friendship allows the List class to access Node private data members directly. No need to use ListNode getters/setters. bool sta Mull

Explanation / Answer

void destroyList() {
   Node *p;
   Node *temp = mpHead;
   while(temp != NULL) {
       p = temp;
       temp = temp->mpNext;
       delete p;
   }
   mpHead = NULL;
}

Navigate

Your Name: TA\'s Name: 16.(2 0 pts) In this problem you will be working with a d

Your Name: TA\'s Name: to tne top of the stack). The function must remove the no

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

Your Name: TA\'s Name: 6. (15 pts) Write a destroyList () member function for th

Question

Explanation / Answer

Related Questions

Navigate