Breaking News: Grepper is joining You.com. Read the official announcement!

queue implementation using linked list in cpp

Add Answer

coder answered on March 28, 2022 Popularity 9/10 Helpfulness 2/10

answer queue implementation using linked list in cpp

related queue implementation using linked list in cpp

related implementation of queue using linked list in c

queue implementation using linked list in cpp

Comment

#include<iostream>
using namespace std;

struct node
{
	int value;
	node* next;
};

class Queue
{
private:
	node* front;
	node* rear;
public:
	Queue()
	{
		front = rear = NULL;
	}
	void EnQueue(int n)
	{
		node* temp = new node();
		temp->value = n;
		temp->next = NULL;

		if (front == NULL && rear == NULL)
		{
			front = rear = temp;
			return;
		}
		rear->next = temp;
		rear = temp;
	}
	void Dequeue()
	{
		node* temp = front;

		if (front == NULL)
		{
			cout << "Queue is empty!\n";
			return;
		}
		else if (front == rear)
		{
			front = rear = NULL;
		}
		else
		{
			front = front->next;
		}

		delete temp;
	}
	int getFront()
	{
		if (front == NULL)
		{
			cout << "Queue is empty!\n";
		}
		else
		{
			return front->value;
		}
	}
	void Display()
	{
		node* temp = front;
		cout << "Queue Item: ";
		while (temp != NULL)
		{
			cout << temp->value << " ";
			temp = temp->next;
		}
		cout << "\n";
	}
};
int main()
{
	Queue q;

	q.EnQueue(1);
	q.EnQueue(2);
	q.EnQueue(3);
	q.EnQueue(4);
	q.EnQueue(5);

	q.Display();  //should print [1 2 3 4 5]

	cout << q.getFront() << "\n";  //should print [1]

	q.Dequeue();   //should delete [1]
	q.Dequeue();  //should delete [2]

	q.Display();  //should print [3 4 5]

	cout << q.getFront() << "\n";  //should print [3]

	return 0;
}

Popularity 9/10 Helpfulness 2/10 Language cpp

Source: www.codegrepper.com

Tags: c++ implementation linked-list queue using

Link to this answer
Share Copy Link

Contributed on Mar 28 2022

coder

0 Answers Avg Quality 2/10

Closely Related Answers

queue implementation using linked list in cpp

Comment

#include<iostream>
using namespace std;

struct node
{
	int value;
	node* next;
};

class Queue
{
private:
	node* front;
	node* rear;
public:
	Queue()
	{
		front = rear = NULL;
	}
	void EnQueue(int n)
	{
		node* temp = new node();
		temp->value = n;
		temp->next = NULL;

		if (front == NULL && rear == NULL)
		{
			front = rear = temp;
			return;
		}
		rear->next = temp;
		rear = temp;
	}
	void Dequeue()
	{
		node* temp = front;

		if (front == NULL)
		{
			cout << "Queue is empty!\n";
			return;
		}
		else if (front == rear)
		{
			front = rear = NULL;
		}
		else
		{
			front = front->next;
		}

		delete temp;
	}
	int getFront()
	{
		if (front == NULL)
		{
			cout << "Queue is empty!\n";
		}
		else
		{
			return front->value;
		}
	}
	void Display()
	{
		node* temp = front;
		cout << "Queue Item: ";
		while (temp != NULL)
		{
			cout << temp->value << " ";
			temp = temp->next;
		}
		cout << "\n";
	}
};
int main()
{
	Queue q;

	q.EnQueue(1);
	q.EnQueue(2);
	q.EnQueue(3);
	q.EnQueue(4);
	q.EnQueue(5);

	q.Display();  //should print [1 2 3 4 5]

	cout << q.getFront() << "\n";  //should print [1]

	q.Dequeue();   //should delete [1]
	q.Dequeue();  //should delete [2]

	q.Display();  //should print [3 4 5]

	cout << q.getFront() << "\n";  //should print [3]

	return 0;
}

Popularity 9/10 Helpfulness 6/10 Language cpp

Source: www.codegrepper.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Mar 28 2022

coder

0 Answers Avg Quality 2/10

implementation of queue using linked list in c

Comment

#include <stdio.h>
#include <stdlib.h>

// Structure to create a node with data and next pointer
struct node {
	int data;
	struct node *next;
};

struct node *front = NULL;
struct node *rear = NULL;

// Enqueue() operation on a queue
void enqueue(int value) {
	struct node *ptr;
	ptr = (struct node *)malloc(sizeof(struct node));
	ptr->data = value;
	ptr->next = NULL;
	if ((front == NULL) && (rear == NULL)) {
		front = rear = ptr;
	} else {
		rear->next = ptr;
		rear = ptr;
	}
	printf("Node is Inserted\n\n");
}

// Dequeue() operation on a queue
int dequeue() {
	if (front == NULL) {
		printf("\nUnderflow\n");
		return -1;
	} else {
		struct node *temp = front;
		int temp_data = front->data;
		front = front->next;
		free(temp);
		return temp_data;
	}
}

// Display all elements of queue
void display() {
	struct node *temp;
	if ((front == NULL) && (rear == NULL)) {
		printf("\nQueue is Empty\n");
	} else {
		printf("The queue is \n");
		temp = front;
		while (temp) {
			printf("%d--->", temp->data);
			temp = temp->next;
		}
		printf("NULL\n\n");
	}
}

int main() {
	int choice, value;
	printf("\nImplementation of Queue using Linked List\n");
	while (choice != 4) {
		printf("1.Enqueue\n2.Dequeue\n3.Display\n4.Exit\n");
		printf("\nEnter your choice : ");
		scanf("%d", &choice);
		switch (choice) {
		case 1:
			printf("\nEnter the value to insert: ");
			scanf("%d", &value);
			enqueue(value);
			break;
		case 2:
			printf("Popped element is :%d\n", dequeue());
			break;
		case 3:
			display();
			break;
		case 4:
			exit(0);
			break;
		default:
			printf("\nWrong Choice\n");
		}
	}
	return 0;
}

Popularity 10/10 Helpfulness 4/10 Language c

Source: www.scaler.com

Tags: c

Link to this answer
Share Copy Link

Contributed on Sep 20 2022

Digvijay Sunil

0 Answers Avg Quality 2/10

implementation of queue using linked list in c

Comment

#include <stdio.h>
#include <stdlib.h>

// Structure to create a node with data and next pointer
struct node {
	int data;
	struct node *next;
};

struct node *front = NULL;
struct node *rear = NULL;

// Enqueue() operation on a queue
void enqueue(int value) {
	struct node *ptr;
	ptr = (struct node *)malloc(sizeof(struct node));
	ptr->data = value;
	ptr->next = NULL;
	if ((front == NULL) && (rear == NULL)) {
		front = rear = ptr;
	} else {
		rear->next = ptr;
		rear = ptr;
	}
	printf("Node is Inserted\n\n");
}

// Dequeue() operation on a queue
int dequeue() {
	if (front == NULL) {
		printf("\nUnderflow\n");
		return -1;
	} else {
		struct node *temp = front;
		int temp_data = front->data;
		front = front->next;
		free(temp);
		return temp_data;
	}
}

// Display all elements of queue
void display() {
	struct node *temp;
	if ((front == NULL) && (rear == NULL)) {
		printf("\nQueue is Empty\n");
	} else {
		printf("The queue is \n");
		temp = front;
		while (temp) {
			printf("%d--->", temp->data);
			temp = temp->next;
		}
		printf("NULL\n\n");
	}
}

int main() {
	int choice, value;
	printf("\nImplementation of Queue using Linked List\n");
	while (choice != 4) {
		printf("1.Enqueue\n2.Dequeue\n3.Display\n4.Exit\n");
		printf("\nEnter your choice : ");
		scanf("%d", &choice);
		switch (choice) {
		case 1:
			printf("\nEnter the value to insert: ");
			scanf("%d", &value);
			enqueue(value);
			break;
		case 2:
			printf("Popped element is :%d\n", dequeue());
			break;
		case 3:
			display();
			break;
		case 4:
			exit(0);
			break;
		default:
			printf("\nWrong Choice\n");
		}
	}
	return 0;
}

Popularity 9/10 Helpfulness 3/10 Language c

Source: www.scaler.com

Tags: c implementation implementat

Link to this answer
Share Copy Link

Contributed on Sep 20 2022

Digvijay Sunil

0 Answers Avg Quality 2/10

queue implementation using linked list in cpp

Contents

More Related Answers

queue implementation using linked list in cpp

Closely Related Answers

queue implementation using linked list in cpp

implementation of queue using linked list in c

implementation of queue using linked list in c

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.