queue.h
#ifndef QUEUE_H_
#define QUEUE_H_
template<class Type>
class Queue{
private:
enum {Q_SIZE = 10};
class Node{
public:
Type data;
Node * next;
Node(const Type data) : data(data), next(0) {}
};
Node *front;
Node *rear;
int curSize;
int maxSize;
public:
Queue(int size = Q_SIZE);
~Queue();
bool isFull() const;
bool isEmpty() const ;
bool enQueue(const Type data);
bool deQueue();
void tarverseQueue() const;
};
#endif
#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <valarray>
#include "queue.h"
using std::cout;
using std::endl;
template<class Type>
Queue<Type>::Queue(int size) : maxSize(size) {
front = rear = 0;
curSize = 0;
}
template<c