Queue implementation with Linked List

queueLinkedList.cpp

//Milad Abbasi
//06-07-2018
//Queue implementation with Linked List

#include <iostream>
using namespace std;

class Node
{
public:
	int data;
	Node *next;
};

class Queue
{
	Node *front, *rear;
public:
	Queue()
	{
		front = rear = NULL;
	}

	void enqueue(int value)
	{
		Node *tmp = new Node;
		tmp->data = value;
		tmp->next = NULL;
		if(!rear)
			front = rear = tmp;
		else
		{
			rear->next = tmp;
			rear = tmp;
		}
	}

	void dequeue(void)
	{
		if(!front)
			cout<<"Queue is empty!";
		else
		{
			Node *tmp = new Node;
			tmp = front;
			front = front->next;
			delete tmp;
		}
	}

	int peek(void)
	{
		return front->data;
	}

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