Sorted Circular Doubly-Linked List ADT with Sentinel Node
Convert the previous lab’s
LinkedList classes to template classes.
Note: Converting the Stack/Queue classes to template classes was an easy task because
search are not valid Stack/Queue operations, therefore it could be done without overloading any operators. However, for a LinkedList class, in order to make
display list functions work with any data type, we have to overload the stream insertion operator. In order to be able to compare objects (in insert, delete, search) we have to overload the relational operators.
In this assignment you are going to work with three classes:
Download and review the following files:
In order to do this, you will have to make the following changes:
College.cppoverload the following operators:
ListNodeADT.hdefine setters and getters
displayListForw(), then finish writing:
main.cpp– most of the code is given; you have to update two manager functions: