In todays lab we will design and implement the List ADT where the items in the list are sorted. c++ language

sortedtype.h

#ifndef SORTEDTYPE_H_INCLUDED

#define SORTEDTYPE_H_INCLUDED

template

class SortedType

{

struct NodeType

{

ItemType info;

NodeType* next;

};

public:

SortedType();

~SortedType();

bool IsFull();

int LengthIs();

void MakeEmpty();

void RetrieveItem(ItemType&, bool&);

void InsertItem(ItemType); void DeleteItem(ItemType); void ResetList();

void GetNextItem(ItemType&); private:

NodeType* listData;

int length;

NodeType* currentPos;

};

#endif // SORTEDTYPE_H_INCLUDED

sortedtype.cpp

#include "sortedtype.h"

#include

using namespace std;

template

SortedType::SortedType() {

length = 0;

listData = NULL;

currentPos = NULL;

}

template

int SortedType::LengthIs() {

return length;

}

template

bool SortedType::IsFull() {

NodeType* location;

try

{

location = new NodeType;

delete location;

return false;

}

catch(bad_alloc& exception)

{

return true;

}

}

template

void SortedType::InsertItem(ItemType item) {

NodeType* newNode;

NodeType* predLoc;

NodeType* location;

bool moreToSearch;

location = listData;

predLoc = NULL;

moreToSearch = (location != NULL);

while (moreToSearch)

{

if (location->info < item)

{

predLoc = location;

location = location->next;

moreToSearch = (location != NULL); }

else moreToSearch = false;

}

newNode = new NodeType;

newNode->info = item;

if (predLoc == NULL)

{

newNode->next = listData;

listData = newNode;

}

else

{

newNode->next = location;

predLoc->next = newNode;

}

length++;

}

template

void SortedType::DeleteItem(ItemType item) {

NodeType* location = listData;

NodeType* tempLocation;

if (item == listData->info)

{

tempLocation = location;

listData = listData->next;

}

else

{

while (!(item==(location->next)->info)) location = location->next;

tempLocation = location->next;

location->next = (location->next)->next; }

delete tempLocation;

length--;

}

template void SortedType::RetrieveItem(ItemType & item, bool& found) { NodeType* location = listData; bool moreToSearch = (location != NULL); found = false; while (moreToSearch && !found) { if (item == location->info) found = true; else if (item > location->info) { location = location->next; moreToSearch = (location != NULL); } else moreToSearch = false; } } template void SortedType::MakeEmpty() { NodeType* tempPtr; while (listData != NULL) { tempPtr = listData; listData = listData->next; delete tempPtr; } length = 0; }

template SortedType::~SortedType() { MakeEmpty(); } template void SortedType::ResetList() { currentPos = NULL; } template void SortedType::GetNextItem(ItemType & item) { if (currentPos == NULL) currentPos = listData; else currentPos = currentPos->next; item = currentPos->info; }

Generate the driver file (main.cpp) where you perform the following tasks. Note that you cannot make any change to the header file or the source file.

Operation to Be Tested and Description of Action	Input Values	Expected Output
Write a class timeStamp that represents a time of the day. It must have variables to store the number of seconds, minutes and hours passed. It also must have a function to print all the values. You will also need to overload a few operators.
Create a list of objects of class timeStamp.
Insert 5 time values in the format ssmmhh	15 34 23 13 13 02 43 45 12 25 36 17 52 02 20
Delete the timestamp 25 36 17
Print the list		13:13:02 15:34:23 43:45:12 52:02:20