Please compile and answer the following for this program related to linked list

Question

Please compile and answer the following for this program related to linked list
- Is the front of the list ever equal to 0 or null? Please explain you answer?
-What are the contents of the header node?
-Please list the order in which nodes are removed from the list by the destructor?
Below is the program:

#include <iostream>
using namespace std;
class LIST_NODE
{
public:
int data; //data element of node
LIST_NODE *next; //pointer element of node
};

class LINKED_LIST_CLASS
{
public:
LINKED_LIST_CLASS();//default constructor
~LINKED_LIST_CLASS(); //destructor
void Add(int); //mutator
void Print(); //accessor
private:

LIST_NODE *front; //pointer to front of list(header node)

};

LINKED_LIST_CLASS::LINKED_LIST_CLASS()
{
cout<<endl<<"Default constructor has been called ";
front = new LIST_NODE;
front->next = 0; //initialize next field to null
front->data = -10000;
}

LINKED_LIST_CLASS::~LINKED_LIST_CLASS()
{
cout<<endl<<"The destructor has been called ";

while (front->next != 0)
{
LIST_NODE *p = front->next;
front->next = front->next->next;
delete p;
}
delete front;
front = 0;
}

void LINKED_LIST_CLASS::Add(int item)
{
LIST_NODE *p = new LIST_NODE;

p->data = item;

if (front->next== 0) //empty list
{
front->next = p;
p->next = 0;
}
else //list has information and is not empty
{
p->next = front->next;
front->next = p;
}
}

void LINKED_LIST_CLASS::Print()
{
cout<<endl;
for(LIST_NODE *p = front->next; p != 0; p = p->next)
{
cout<<p->data;
if (p->next != 0)
{
cout<<"-->";
}
}
cout<<endl<<endl;
}


int main ()
{
LINKED_LIST_CLASS sample1;

sample1.Add(4);
sample1.Add(5);
sample1.Add(6);
sample1.Add(4);
sample1.Add(7);
sample1.Print();
return 0;
}

Explanation / Answer

//- Is the front of the list ever equal to 0 or null? Please explain you answer? yes if the linked list is empty the front will be equla to 0 Null //-What are the contents of the header node? the header node contains the adress for the next node and a pointer to the next node //-Please list the order in which nodes are removed from the list by the destructor? the nodes will be deleted from the beginning to the end like this 4 then 5 then 6 then 4 finally 7

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

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