큐 구현 #include #include using namespace std; template class Queue { int front, rear; T *queue; int max; public: Queue() { front=-1, rear = -1; } void create_queue(int max) { this->max = max; queue = new T[max]; } void enque(T element) { if (!is_full())queue[++rear] = element; else cout