In C++ create a Node struct containing a string (element_name) and an int (element_count) as well as a node pointer (Node* next). Create a LinkedList class with the following public functions:

Constructor (with no parameters) creates an empty list.

Deconstructor deletes the list.

isEmpty checks if the list is empty.

AddData Adds a new Node to the Linked List. The new Node should be added to the front of the list.

DeleteData deletes a Node from the Linked List that contains the data specified as input parameters (name, count).

toString returns a string containing the contents of the LinkedList from the first Node to the last Node. For example:

 [Cat, 6] -> [Dog, 18] -> [Fish, 12] 

The class should also contain the following private member variables:

Node* first a pointer to the beginning of the LinkedList

Node *last a pointer to the end of the LinkedList (this variable may be useful but is optional)

CSCI 1060U Programming Workshop I Laboratory #9 & #10 (2015)

Activity #2

Extend the LinkedList class by adding data analysis functionality.

The first step is to modify the AddData function to add a new Node alphabetically based on name (instead of only to the front of the LinkedList). This means that you will have to search through the lists contents and insert the new node in the appropriate location. This location could be at the beginning, middle, or end of the list.

The second step is to add the following friend functions: printRawData prints the data values and their counts. For example:

 Cat: 6 Dog: 18 Fish: 12 

printHistogram prints a histogram of the data. For example:

 Cat: ****** Dog: ****************** Fish: ************ 

calculateMean calculates the mean count for all data elements.