Data-Structure/queue_double_pointers.cpp at main · MKamel2610/Data-Structure · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include <iostream>
using namespace std;

class array_queue{
    int *arr;
    int capacity;
    int rear;
    int front;
public:

    array_queue(int size){
        arr = new int [size];
        capacity = size;
        rear = front = 0;
    }

    ~array_queue(){
        delete [] arr;
    }

    bool isEmpty(){
        return (rear == 0);
    }

    bool isFull(){
        return (front == rear);
    }

    void enqueue(int element){
        arr[rear++] = element;
    }

    void dequeue(){
        front++;
    }
};

int main() {
    std::cout << "Hello, World!" << std::endl;
    return 0;
}