/* CIS 22C: Sorted Circular Doubly-Linked List with Sentinel Node This program: - Creates a sorted linked list (student name and gpa). The list is sorted in ascending order by name. Assume name is a unique identifier. - Displays the list forwards(A to Z) - Displays the list backwards(Z to A) Your task is to finish writing the following three functions: - default constructor (reuse code from your previous lab) - `displayListBack()` (reuse code from your previous lab) - `insertNode()` - change this function to reject duplicates. Assume `name` is a unique key. Written by: Iurii Tatishchev Reviewed by: Iurii Tatishchev IDE: CLion */ #include #include #include "StudentList.h" using namespace std; void buildList(StudentList &); int main() { // Define a StudentList object StudentList list; buildList(list); // insert data into the list cout << "The number of elements in the list is " << list.getCount() << "." << endl; string answer; cout << "Insert [Y/N]? "; cin >> answer; if (answer == "Y" || answer == "y") { Student s; cout << "Enter gpa then enter name:" << endl; cin >> s.gpa >> s.name; if (!list.insertNode(s)) { cout << s.name << " - rejected: duplicate key!" << endl; } cout << "The number of elements in the list is " << list.getCount() << "." << endl; } cout << endl; list.displayListForw(); list.displayListBack(); return 0; } /* ************************************************** This function builds a sorted linked list with data from the keyboard. The list is sorted in ascending order by the students' names. It calls the insertNode() function that inserts the new data at the right location in the linked list. An input line contains the gpa of a student follow by its name (assume it is a single word name) To stop reading enter "#" ************************************************** */ void buildList(StudentList &list) { string line; getline(cin, line); while (line != "#") { stringstream temp(line); // create a stringstream named temp with data from line Student newStu; temp >> newStu.gpa; // read gpa from temp temp >> newStu.name; // read name from temp list.insertNode(newStu); getline(cin, line); } }