Homework 11

Question 11(a) from Chapter 4 of the text (p. 210)

Solution

LinkedList::~LinkedList ()
{
   if (Head == NULL) return;  // case 0
   NodeType *p = Head->Next;  // case n
   while (p != Head);
   {
      NodeType *t = p;
      p = p->Next;
      delete t;
   }
   delete Head;               // case 1
   Head = NULL;
}