implementationofKQueueUsingSingleArrayl61.cpp

#include<iostream>
using namespace std;
class kQueue{
    public:
    int n;
    int k;
    int *front;
    int *rear;
    int *arr;
    int freeSpot;
    int *next;
    public:
    kQueue(int n, int k){
        this->n=n;
        this->k =k;
        front = new int[k];
        rear = new int[k];
        for(int i = 0; i<k; i++){
            front[i] = -1;
            rear[i] = -1;
        }
        next =  new int[n];
        for(int i = 0; i<n; i++){
            next[i] = i+1;
        }
        next[n-1] = -1;
        arr = new int[n];
        freeSpot = 0;
    }
    void enqueue(int data, int qn){
        //overflow
        if(freeSpot == -1){
            cout<<"No empty space is present"<<endl;
            return ;
        }
        // find first free space
        int index = freeSpot;
        //update freeSpot
        freeSpot  = next[index];
        //check whether first element
        if(front[qn-1]==-1){
            front[qn-1] = index;
        }
        else{
            //link new element to the prev element
            next[rear[n-1]]= index;
        }
        //update next
        next[index] = -1;
        // update rear
        rear[qn-1]= index;
        //push element
        arr[index] = data;
    }
};
int main(){

    return 0;
}