-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 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. The files are supplied below

unorderedLinkedList.h (4 photos)

orderedLinkedLists.h

testProgUnorderedLinkedList.cpp

linkedList.h

Miscellaneous Files (Global Scope) \} Hend1f Miscellaneous Files (Global Scope) \} Hend1f