Code must be in C CODE MUST BE IN C Answer with DListC and D

Code must be in C++!!!
CODE MUST BE IN C++!!!!!!!!

Answer with DList.C and DList.h

//Here is the main.C file

In this project, you are asked to design and implement a class for double link list to hold integers: The class should be called DList, you also need a class called Node that contains an int as the data Node needs the following data: int data //the data held by the node Node parent; //the parent of the Node Node* child; the child of the Node Node needs the following public functions Node (int) constructor to create a Node with the input int int GetData return the int held by the Node DList needs a head and tail, both should be pointers to Node, and initialized to NULL DList needs a default constructor (no parameter), a copy constructor (take const DList & as input) DList needs the following public functions: void Push Front (int a) //create a Node containing a //and add i to the front of the list void Push End (int a) //create a Node containing a and add it to the end of the list Node PopFront //popping out the first Node of the list, //if the list i s empty, return NULL Node* PopEnd //popping out the last Node of the list, //if the list is empty return NULL void Print ListForward //print every element from start to end //in one line separated by a space void Print ListReverse //print every element from end to start //in one line separated by a space 2 Files to turn in: You need to turn in four files in a targz file: makefile, main.C, DList.C, DList.h. Among them, you need to use the main. C provided from the class web site which you cannot modify at all. DList h declares the class DList and Node. You can make DList the friend of Node so it can access the private data of the Node.

Solution

#include \"DList.h\" #include using namespace std; int main() { DList list; int i; //pust 10 numbers to the end for (i = 0; i < 10; i++) list.PushEnd(i); cout << \"Print forward\ \"; list.PrintListForward(); cout << \"Print reverse\ \"; list.PrintListReverse(); cout << \"Pop front and print\ \"; //print the list from the beginning Node* n = list.PopFront(); while ( n != NULL) { cout << n->GetData() << endl; delete n; n = list.PopFront(); } //pust 10 numbers to the front for (i = 0; i < 10; i++) list.PushFront(i); //test copy constructor DList* list2 = new DList(list); cout << \"Pop end and print\ \"; //print the list from the end n = list2->PopEnd(); while ( n != NULL) { cout << n->GetData() << endl; delete n; n = list2->PopEnd(); } delete list2; return 0; }