Computer Science Homework C++ : Linked List Address Book Project I need help with coding this assigment.

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 it returns false.

void insert(const Type& newItem); //Function to insert newItem in the list.

//Postcondition: first points to the new list, newItem // is inserted at the proper place in the // list, and count is incremented by 1.

void insertFirst(const Type& newItem); //Function to insert newItem in the list.

//Because the resulting list must be sorted, newItem is //inserted at the proper in the list.

//This function uses the function insert to insert newItem.

//Postcondition: first points to the new list, newItem is // inserted at the proper in the list, // and count is incremented by 1.

void insertLast(const Type& newItem); //Function to insert newItem in the list.

//Because the resulting list must be sorted, newItem is //inserted at the proper in the list.

//This function uses the function insert to insert newItem.

//Postcondition: first points to the new list, newItem is // inserted at the proper in the list, // 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 of the // new list, and count is decremented by 1.

// If deleteItem is not in the list, an // appropriate message is printed.

}; template bool orderedLinkedList::

search(const Type& searchItem) const { bool found = false; nodeType *current; //pointer to traverse the list current = this->first; //start the search at the first node while (current != nullptr && !found) if (current->info >= searchItem) found = true; else current = current->link; if (found) found = (current->info == searchItem); //test for equality return found; }//end search template void orderedLinkedList::insert(const Type& newItem) { nodeType *current; //pointer to traverse the list nodeType *trailCurrent = nullptr; //pointer just before current nodeType *newNode; //pointer to create a node bool found; newNode = new nodeType; //create the node newNode->info = newItem; //store newItem in the node newNode->link = nullptr; //set the link field of the node to nullptr if (this->first == nullptr) //Case 1 { this->first = newNode; this->last = newNode; this->count++; } else { current = this->first; found = false; while (current != nullptr && !found) //search the list if (current->info >= newItem) found = true; else { trailCurrent = current; current = current->link; } if (current == this->first) //Case 2 { newNode->link = this->first; this->first = newNode; this->count++; } else //Case 3 { trailCurrent->link = newNode; newNode->link = current; if (current == nullptr) this->last = newNode; this->count++; } }//end else }//end insert template void orderedLinkedList::insertFirst(const Type& newItem) { insert(newItem); }//end insertFirst template void orderedLinkedList::insertLast(const Type& newItem) { insert(newItem); }//end insertLast template void orderedLinkedList::deleteNode(const Type& deleteItem) { nodeType *current; //pointer to traverse the list nodeType *trailCurrent = nullptr; //pointer just //before current bool found; if (this->first == nullptr) //Case 1 cout << "Cannot delete from an empty list." << endl; else { current = this->first; found = false; while (current != nullptr && !found) //search the list if (current->info >= deleteItem) found = true; else { trailCurrent = current; current = current->link; } if (current == nullptr) //Case 4 cout << "The item to be deleted is not in the " << "list." << endl; else if (current->info == deleteItem) //the item to be //deleted is in the list { if (this->first == current) //Case 2 { this->first = this->first->link; if (this->first == nullptr) this->last = nullptr; delete current; } else //Case 3 { trailCurrent->link = current->link; if (current == this->last) this->last = trailCurrent; delete current; } this->count--; } else //Case 4 cout << "The item to be deleted is not in the " << "list." << endl; } }//end deleteNode #endif