Writing Queue Data Structure In C++

on the same line of our previous post, here is how to write Queue in c++:

<pre>
#include <iostream.h>

struct node
{
	int data;
	node *link;
};

class queue
{
	private:
		node *front, *rear;

	public:

		queue()
		{
			front = rear = NULL;
		}

		void addq(int item)
		{
			node *temp;

			temp = new node;

			if(temp == NULL)
				cout << endl << "Queue is full";

			temp->data = item;
			temp->link = NULL;

			if(front == NULL)
			{
				rear = front = temp;
				return;
			}

			rear->link = temp;
			rear = rear->link;
		}

		int delq()
		{
			if(front == NULL)
			{
				cout << endl << "Queue is empty";
				return;
			}

			node *temp;
			int item;

			item = front->data;
			temp = front;
			front = front->link;
			delete temp;
			return item;
		}

		~queue()
		{
			if(front == NULL)
			return;
			node *temp;
			while(front != NULL)
			{
				temp = front;
				front = front->link;
				delete temp;
			}
		}
};</pre>