Linked List Operations

LinkedListType, unorderedLinkedList, and orderedLinkedList are given to you in Chapter 17. linkedListIterator is given to you as well. The files are supplied here.

Overload the insertFirst and insertLast pure virtual functions such that they accept a vector of possible values as parameters. All values in the vector are to be inserted.

Overload the deleteNode pure virtual function such that it accepts a vector of possible values. All values in the vector should be deleted.

Modify deleteNode such that an exception is thrown when called on an empty list and when the item to delete is not in the list.

Finally create a 2 lists using the STL list container. Add some values to them and sort them. Merge the two lists together into one list. Print the list using the screen iterator example from Appendix H.

Useful notes:

Leverage the functions which are already given to you.

Submission requirements:

template bool unorderedLinkedList:: unorderedLinkedList +search(const Type&) const: bool +insertFirst(const Type&): void +insertLast(const Type&): void +deleteNode(const Type&): void linkedListType unorderedLinkedList { search(const Type& searchItem) const nodeType *current; //pointer to traverse the list bool found = false; current = first; //set current to point to the first //node in the list while (current != nullptr && !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

Ordered Link List code

template bool orderedLinkedList:: { search(const Type& searchItem) const bool found = false; nodeType *current; //pointer to traverse the list current = 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