template < class T > class queue{
	public:
		// constructor
		queue();

		// inserts item at the back of the queue
		void enqueue(const T & item);

		// deletes and returns the item at the front of the queue
		T dequeue();

		// indicates if the queue is empty
		bool isEmpty();

		// destructor
		~queue();
	private:
		node < T > * front;
};