[자료구조] [C++] CircularQueue 사이클 큐

#include<iostream>
#include<string>
 
typedef struct Node {
    std::string data;
}Node;
 
class cir_queue {
private:
    Node* node;
    int size;
    int front;
    int back;
public:
    cir_queue(int size) {
        this->size = size + 1; //더미 공간
        node = new Node[this->size];
        front = 0; back = 0;
    }
    
    void enqueue(std::string data) {
        int index;
 
        if (back == size - 1){
            index = back;
            back = 0;
        }
        else {
            index = back++;
        }
 
        node[index].data = data;
    }
    
    std::string dequeue() {
        int index = front;
 
        if (front == size - 1) front = 0;
        else front++;
 
        return node[index].data;
    }
 
    int get_size() {
        if (front <= back) return back - front;
        else return size - front + back;
    }
};