This will need to be in a header file called LinkedList.hInser.pdf

This will need to be in a header file called "LinkedList.h"
//Insertion
void AddHead(const T& data); //(Create a new Node at the front of the list to store the passed in
parameter.)
void AddTail(const T& data); //(Create a new Node at the end of the list to store the passed in
parameter.)
void AddNodesHead(const T* data, unsigned int count); //Given an array of values, insert a node
for each of those at the beginning of the list, maintaining the original order.
void AddNodesTail(const T* data, unsigned int count); //except adding to the end of the list
//Accessors
unsigned int NodeCount() const;
//Behaviors
void PrintForward() const; //Iterator through all of the nodes and print out their values, one a
time.
void PrintReverse() const; //Exactly the same as PrintForward, except completely the opposite
//Default Constructor
LinkedList(); //
//Destructor
~LinkedList(); //(Delete all the nodes created by the list.)
main.cpp:
#include
#include
#include
#include "LinkedList.h"
using namespace std;
void TestAddHead();
void TestAddTail();
void TestAddingArrays();
int main()
{
int testNum;
cin >> testNum;
if (testNum == 1)
TestAddHead();
else if (testNum == 2)

TestAddTail();
else if (testNum == 3)
TestAddingArrays();
return 0;
}
void TestAddHead()
{
cout << "=====Testing AddHead() functionality====" << endl;
LinkedList data;
for (int i = 0; i < 12; i += 2)
data.AddHead(i);
cout << "Node count: " << data.NodeCount() << endl;
cout << "Print list forward:" << endl;
data.PrintForward();
cout << "Print list in reverse:" << endl;
data.PrintReverse();
}
void TestAddTail()
{
cout << "=====Testing AddTail() functionality====" << endl;
LinkedList data;
for (int i = 0; i <= 21; i += 3)
data.AddTail(i);
cout << "Node count: " << data.NodeCount() << endl;
cout << "Print list forward:" << endl;
data.PrintForward();
cout << "Print list in reverse:" << endl;
data.PrintReverse();
}
void TestAddingArrays()
{
cout << "=====Testing AddNodesHead() and AddNodesTail() =====" << endl;
string values[5];
values[0] = "*";
values[1] = "**";
values[2] = "***";

values[3] = "****";
values[4] = "*****";
LinkedList list;
list.AddHead("**");
list.AddHead("***");
list.AddHead("****");
list.AddHead("*****");
list.AddHead("******");
list.AddHead("*******");
list.AddHead("********");
list.AddHead("*********");
list.AddHead("********");
list.AddHead("*******");
list.AddHead("******");
list.AddNodesHead(values, 5);
list.AddNodesTail(values, 5);
list.PrintForward();
}

This will need to be in a header file called LinkedList.hInser.pdf

More Related Content

Similar to This will need to be in a header file called LinkedList.hInser.pdf (20)

More from cleanhome88 (7)

Recently uploaded (20)

This will need to be in a header file called LinkedList.hInser.pdf