void divideMid(linkedListType &sublist); //This operation divides the given list into tow sublists of almost equal sizes //Postcondition: first points to the first node and last points to the last node of the first sublist. sublist.first points to the first node and sublist.last points to the last node of the second sublist.

Consider the following statements: unorderedLinkedList myList; unorderedLinkedList subList; Suppose myList points to the list with elements 34 65 27 89 12 (in this order).

The statement: myList.divideMid(subList); //divides myList into 2 sublists: myList points to the list with the elements 34 65n27, and subList points to the sublist with the elements 89 12 b. Write the definition of the function template to implement the operation divideMid. Also, write a program to test your function.

This question has been asked before on here and I tried using the answers from it but it doesn't work. I'll paste my code and let me know what is wrong with it or what else I should do.

#include using namespace std;

template struct nodeType{ Type info; nodeType *link; };

template class linkedListIterator { public:

linkedListIterator(); //Default constructor //Postcondition: current = NULL;

linkedListIterator(nodeType *ptr); //Constructor with a parameter. //Postcondition: current = ptr;

Type operator*(); //Function to overload the dereferencing operator *. //Postcondition: Returns the info contained in the node.

linkedListIterator operator++(); //Overload the preincrement operator. //Postcondition: The iterator is advanced to the next node.

bool operator==(const linkedListIterator& right) const; //Overload the equality operator. //Postcondition: Returns true if this iterator is equal to // the iterator specified by right, otherwise it returns // false.

bool operator!=(const linkedListIterator& right) const; //Overload the not equal to operator. //Postcondition: Returns true if this iterator is not equal to // the iterator specified by right, otherwise it returns // false.

private:

nodeType *current; //pointer to point to the current //node in the linked list };

template linkedListIterator::linkedListIterator() { current = NULL; }

template linkedListIterator::linkedListIterator(nodeType *ptr) { current = ptr; }

template Type linkedListIterator::operator*() { return current->info; }

template linkedListIterator linkedListIterator::operator++() { current = current->link; return *this; }

template bool linkedListIterator::operator==(const linkedListIterator& right) const { return (current == right.current); }

template bool linkedListIterator::operator!=(const linkedListIterator& right) const { return (current != right.current); }

template class linkedListType { public:

const linkedListType& operator= (const linkedListType&); //Overload the assignment operator. void initializeList(); //Initialize the list to an empty state. //Postcondition: first = NULL, last = NULL, count = 0;

bool isEmptyList() const; //Function to determine whether the list is empty. //Postcondition: Returns true if the list is empty, otherwise // it returns false.

void print(bool sideways = false) const; //Function to output the data contained in each node. //Postcondition: none int length() const; //Function to return the number of nodes in the list. //Postcondition: The value of count is returned. void destroyList(); //Function to delete all the nodes from the list. //Postcondition: first = NULL, last = NULL, count = 0; Type front() const; //Function to return the first element of the list. //Precondition: The list must exist and must not be empty. //Postcondition: If the list is empty, the program terminates; // otherwise, the first element of the list is returned. Type back() const; //Function to return the last element of the list. //Precondition: The list must exist and must not be empty. //Postcondition: If the list is empty, the program // terminates; otherwise, the last // element of the list is returned. virtual bool search(const Type& searchItem) const = 0; //Function to determine whether searchItem is in the list. //Postcondition: Returns true if searchItem is in the list, // otherwise the value false is returned. virtual void insertFirst(const Type& newItem) = 0; //Function to insert newItem at the beginning of the list. //Postcondition: first points to the new list, newItem is // inserted at the beginning of the list, last points to // the last node in the list, and count is incremented by // 1. virtual void insertLast(const Type& newItem) = 0; //Function to insert newItem at the end of the list. //Postcondition: first points to the new list, newItem is // inserted at the end of the list, last points to the // last node in the list, and count is incremented by 1. virtual void deleteNode(const Type& deleteItem) = 0; //Function to delete deleteItem from the list. //Postcondition: If found, the node containing deleteItem is // deleted from the list. first points to the first node, // last points to the last node of the updated list, and // count is decremented by 1. linkedListIterator begin(); //Function to return an iterator at the beginning of the //linked list. //Postcondition: Returns an iterator such that current is set // to first.

linkedListIterator end(); //Function to return an iterator one element past the //last element of the linked list. //Postcondition: Returns an iterator such that current is set // to NULL. linkedListType(); //default constructor //Initializes the list to an empty state. //Postcondition: first = NULL, last = NULL, count = 0; linkedListType(const linkedListType& otherList); //copy constructor ~linkedListType(); //destructor //Deletes all the nodes from the list. //Postcondition: The list object is destroyed. void divideMid(linkedListType &subList); //This operation divides the given list into two sublists of (almost) equal sizes protected:

int count; //variable to store the number of list elements nodeType *first; //pointer to the first node of the list nodeType *last; //pointer to the last node of the list

private:

void copyList(const linkedListType& otherList); //Function to make a copy of otherList. //Postcondition: A copy of otherList is created and assigned // to this list. };

template bool linkedListType::isEmptyList() const { return (first == NULL); }

template linkedListType::linkedListType() //default constructor { first = NULL; last = NULL; count = 0; }

template void linkedListType::destroyList() { nodeType *temp; //pointer to deallocate the memory //occupied by the node while (first != NULL) //while there are nodes in the list { temp = first; //set temp to the current node first = first->link; //advance first to the next node delete temp; //deallocate the memory occupied by temp }

last = NULL; //initialize last to NULL; first has already //been set to NULL by the while loop count = 0; }

template void linkedListType::initializeList() { destroyList(); //if the list has any nodes, delete them }

template void linkedListType::print(bool sideways) const { nodeType *current; //pointer to traverse the list current = first; //set current point to the first node while (current != NULL) //while more data to print { if (sideways) { cout << current->info << " "; } else { cout << current->info << endl; } current = current->link; } }//end print

template int linkedListType::length() const { return count; }

template Type linkedListType::front() const { return first->info; //return the info of the first node }//end front

template Type linkedListType::back() const { return last->info; //return the info of the last node }//end back

template linkedListIterator linkedListType::begin() { linkedListIterator temp(first); return temp; }

template linkedListIterator linkedListType::end() { linkedListIterator temp(NULL); return temp; }

template void linkedListType::copyList(const linkedListType& otherList) { nodeType *newNode; //pointer to create a node nodeType *current; //pointer to traverse the list

if (first != NULL) //if the list is nonempty, make it empty destroyList(); if (otherList.first == NULL) //otherList is empty { first = NULL; last = NULL; count = 0; } else { current = otherList.first; //current points to the //list to be copied count = otherList.count;

//copy the first node first = new nodeType; //create the node first->info = current->info; //copy the info first->link = NULL; //set the link field of the node to NULL last = first; //make last point to the first node current = current->link; //make current point to the next // node

//copy the remaining list while (current != NULL) { newNode = new nodeType; //create a node newNode->info = current->info; //copy the info newNode->link = NULL; //set the link of newNode to NULL last->link = newNode; //attach newNode after last last = newNode; //make last point to the actual last //node current = current->link; //make current point to the //next node }//end while }//end else }//end copyList

template linkedListType::~linkedListType() //destructor { destroyList(); }

template linkedListType::linkedListType(const linkedListType& otherList) { first = NULL; copyList(otherList); }//end copy constructor

//overload the assignment operator template const linkedListType& linkedListType::operator=(const linkedListType& otherList) { if (this != &otherList) //avoid self-copy { copyList(otherList); }

return *this; }

template class unorderedLinkedList: public linkedListType{

public:

bool search(const Type& searchItem) const; //Function to determine whether searchItem is in the list. //Postcondition: Returns true if searchItem is in the list, // otherwise the value false is returned. void insertFirst(const Type& newItem); //Function to insert newItem at the beginning of the list. //Postcondition: first points to the new list, newItem is // inserted at the beginning of the list, last points to // the last node, and count is incremented by 1. // void insertLast(const Type& newItem); //Function to insert newItem at the end of the list. //Postcondition: first points to the new list, newItem is // inserted at the end of the list, last points to the // last node, and count is incremented by 1. void deleteNode(const Type& deleteItem); //Function to delete deleteItem from the list. //Postcondition: If found, the node containing deleteItem // is deleted from the list. first points to the first // node, last points to the last node of the updated // list, and count is decremented by 1. };

template bool unorderedLinkedList::search(const Type& searchItem) const { nodeType *current; //pointer to traverse the list bool found = false; current = this->first; //set current to point to the first //node in the list while (current != NULL && !found) //search the list { if (current->info == searchItem) //searchItem is found found = true; else current = current->link; //make current point to //the next node }

return found; }//end search

template void unorderedLinkedList::insertFirst(const Type& newItem) { nodeType *newNode; //pointer to create the new node newNode = new nodeType; //create the new node newNode->info = newItem; //store the new item in the node newNode->link = this->first; //insert newNode before first this->first = newNode; //make first point to the actual first node this->count++; //increment count

if (this->last == NULL) //if the list was empty, newNode is also //the last node in the list this->last = newNode; }//end insertFirst

template void unorderedLinkedList::insertLast(const Type& newItem) { nodeType *newNode; //pointer to create the new node newNode = new nodeType; //create the new node newNode->info = newItem; //store the new item in the node newNode->link = NULL; //set the link field of newNode to NULL

if (this->first == NULL) //if the list is empty, newNode is //both the first and last node { this->first = newNode; this->last = newNode; this->count++; //increment count } else //the list is not empty, insert newNode after last { this->last->link = newNode; //insert newNode after last this->last = newNode; //make last point to the actual //last node in the list this->count++; //increment count } }//end insertLast

template void unorderedLinkedList::deleteNode(const Type& deleteItem) { nodeType *current; //pointer to traverse the list nodeType *trailCurrent; //pointer just before current bool found;

if (this->first == NULL) //Case 1; the list is empty. cout << "Cannot delete from an empty list." << endl; else { if (this->first->info == deleteItem) //Case 2 { current = this->first; this->first = this->first->link; this->count--; if (this->first == NULL) //the list has only one node this->last = NULL;

delete current; } else //search the list for the node with the given info { found = false; trailCurrent = this->first; //set trailCurrent to point //to the first node current = this->first->link; //set current to point to //the second node

while (current != NULL && !found) { if (current->info != deleteItem) { trailCurrent = current; current = current-> link; } else found = true; }//end while

if (found) //Case 3; if found, delete the node { trailCurrent->link = current->link; this->count--; if (this->last == current) //node to be deleted was the //last node this->last = trailCurrent; //update the value of last delete current; //delete the node from the list } else cout << "The item to be deleted is not in the list." << endl; }//end else }//end else }//end deleteNode

template void unorderedLinkedList::divideMid(unorderedLinkedList &subList){

nodeType *current = first;

int count = 0;

while(current != NULL){ count++; current = current->link; }

int temp = (count + 1) / 2; current = first;

for(int i = 1; i < temp; i++){ current = current->link; }

subList.initializeList();

nodeType *current1 = current->link;

current->link = NULL; last = current;

for(int i = temp; i < count; i++){ subList.insertLast(current1->info); current1 = current1->link; } }

int main(){ cout<<"This program divides a linked list into two sublists of almost equal sizes depending on the size of the list."< myList; unorderedLinkedList subList; cout<<"Inserting numbers into the list."<

The error I'm getting says that my divideMid function isn't declared in the unorderedLinkedList class but that class inherits from the one that it's in.