linked_list_implementation.cpp

#include<bits/stdc++.h>
using namespace std;
class Queue{
	int cs;
	list<int>qu;
public:
	Queue(){
     this->cs=0;

	}
	bool isEmpty(){
     return this->cs==0;
	}
	void enqueue(int data){
		this->qu.push_back(data);
		this->cs+=1;
	}
	void dequeue(){
		if(!isEmpty()){
			this->cs-=1;
			this->qu.pop_front();
		}

	}
	int getFront(){
		return this->qu.front();

	}
};

int main(int argc, char const *argv[])
{
	Queue q(10);
	for(int i=0;i<=5;i++){
		q.enqueue(i);
	}
	q.dequeue();
	q.enqueue(8);
	while(!q.isEmpty()){
		cout<<q.getFront()<<endl;
		q.dequeue();
	}
	return 0;

}