//
// File: gradelnklist.h.  Class and Type definitions for dynamic memory
// allocation implementation of a list of grades.  Each node in the list 
// contains a grade and the occurrence count for that grade.
// The grades are stored in ascending order.
// 


struct NodeType {
	int grade;        // grade itself
	int count;        // number of occurrences of grade
	NodeType* next;
};

class GradeList {
public:

// List constructor and destructor
	GradeList();
	~GradeList();

// Methods that test for certain conditions
	bool IsEmpty();
	bool IsFull();

// Methods that work with grades
	void Display();
	void InsertGrade(int newgrade);
	void DeleteGrade(int delgrade);
	float CalculateAvg();
	void DropLowestGrade();
	int HowManyofGrade(int grade);

private:
	NodeType* head;  // pointer to head node
};