Queue Using Linked List In Data Structure Using C++

Data Structure Using C++

Queue Data Structure

Queue Using Linked List

class queue
{
 private:
  node *front;
  node *rear;
 public:
  queue();
  void enqueue(int );
  int dequeue ();
  int front();
  int isEmpty();
};
queue::queue()
{
 front=NULL;
 rear=NULL;
}
void queue::enqueue(int val)
{
 node* newNode = new node(val);
 if(this->isEmpty()){
  front=newNode;
  rear=newNode;
 }else{  
  rear->setNext(newNode);
     rear = newNode;
 } 
}
int queue::dequeue()
{
 if(!isEmpty()){
     int x = front->get();
     front = front->getNext();
     return x;  
 } 
}
int queue::front()
{
 if(!isEmpty())
 {
  return front->get();
 }
 else
 {
  cout<<"queue is empty."<<endl;
 }
}
int queue::isEmpty()
{
 return (front==NULL);
}
int main ()
{
 queue q;
 q.dequeue();
 q.enqueue(2);
 q.enqueue(3);
 q.enqueue(4);
 cout<<q.front();
 cout<<endl;
 q.dequeue();
 cout<<q.front(); 
}

Let me know in the comment section if you have any question.

Previous Post:
Queue Using Array In Data Structure Using C++

Next Post:

Priority Queue Using Linked List In Data Structure Using C++