#ifndef queue_h
#define queue_h

#include <iostream>

#include "listNode2.h"

using namespace std; 
using namespace main_savitch_6B ;

typedef bool boolean ;

template <class T>
class queue{
  public:
    void enqueue(const T &) ; // push on back
    T dequeue(void) ;         // get from front
    boolean isEmpty(void) ;   // is queue empty?
    queue(void) ;             // constructor
     ~queue(void) ; 	      // destructor
  private:
    node<T> * front ;         // pointer to front
}; //end of queue class

#include "queue.cxx"

#endif