Posted: September 18th, 2017
Create two linked lists each having ten nodes…..the first list has a pointer called UNO to the first node and the second list has a pointer called DUO to the first node. The lists are to be sorted BY GPA as you create them. The data in the lists will consist of a last name and GPA (e.g. Smith 3.99).
Print out each sorted list after you create them… then delete all nodes from the FIRST list whose GPA is ABOVE 3.0…and delete all nodes from the second list whose GPA is BELLOW 2.0. Print out both of these modified lists
Finally… merge the REMAINING nodes from both lists into one list headed by first. Print out the final list and the average GPA. THIS LIST should be created sorted by NAME.
Place an order in 3 easy steps. Takes less than 5 mins.