Design your own templated linked list class to hold a series of values
Your Own Linked List Template
Design your own templated linked list class to hold a series of values in ascending order. The class should have member functions for inserting, deleting, and printing nodes. Don’t forget to add a destructor that destroys the list. Demonstrate the class with a driver program.
The delete node method should throw an exception if the linked list is empty.
Insertion method: 2 points
Deletion method: 1 points
Appending method: 1 points
Constructor/Destructor: 2 points
Exceptions: 1 point
Template: 1 point
Demonstration: 2 points