#ifndef _LISTCLASS_H
#define _LISTCLASS_H

//	ListClass.h
//	11.3.98
//	G. Volger
//	Linked List ordered class
//	Items are stored in increasing order

template <class type>
class List
{
	public:
		List();		// Constructor
		~List();	// Destructor
		void Insert(const type & x);
		void Remove(type & x);
		bool isEmpty() const;

	private:
		struct Node;
		typedef Node * Link;
		struct Node
		{
			type data;
			Link next;
		};
		Link head;
};

#include "ListClass.cpp"

#endif


/*

List()
// post: Set the list to empty

~List()
// post: Delete all nodes in the link list

void Insert(const type & x)
// pre: <= and < operator for <class type> must be overloaded already
// post: Add node to ordered linked list, from least to greatest, in correct location.
//       If the item to be inserted has the same value as a value(s) in the list,
//       the new item should be inserted after the current value(s) in the list.

void Remove(type & x)
// post: Removes and returns the node at the front of the list

bool isEmpty() const
// post: Returns true if list is empty, otherwise returns false

*/