INTRODUCTION:
You are required to build the infrastructure to manipulate data related to student scores. Your client
further specifies that you are to create a class named LinkedList to store the students’ information.
The LinkedList will store each name of the student and their score in a Node of the list, using the
provided class Student.
Task:
You are required to use a linked list, as discussed in lectures, to create your own implementation of the
LinkedList class. It will use instances of Node to store instances of value_type (in this
task, each Node will be used to store an instance of Student).
The LinkedList class will be used by a main program, to be supplied to you, as well as a
makefile. You will need to design LinkedList and Node in a way that it communicates
seamlessly with the main program and the class Student provided, and compiles with the
makefile also supplied. Please refer to the lecture slides and recordings for guidance on how to
implement both classes.
Additionally:
Implement the member method void order() inside LinkedList. That
method will order the names of the student in alphabetical order. You are NOT ALLOWED to
manipulate the contents of the Node’s value_type variable. You can only manipulate the
pointers of the nodes to move them around until the list is ordered. In addition, you are NOT
ALLOWED to instantiate new nodes in the implementation of the method void order().
Remember that your code should compile and run correctly using Cygwin. There should be no segmentation faults or memory leaks during or after the execution of the program.