Data-structure/queue_using_linked_list.cpp at master · Bhanups123/Data-structure · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include<iostream>
using namespace std;
struct node{
	int data;
	node* next;
};
node* front= NULL;
node* rear= NULL;
void enqueue(int data){
	node* new_node = new node;
	new_node->data = data;
	new_node->next = NULL;

	if(front == NULL && rear== NULL){
		front = new_node;
		rear = new_node;
	}
	else{
		rear->next = new_node;
		rear = new_node;
	}
}
void dequeue(){
	node* temp = front;
	if(front == NULL && rear == NULL){
		cout<<"underflow"<<endl;
		return;
	}
	else if(front == rear){
		front = NULL;
		rear = NULL;
	}
	else{
		front = front->next;
	}
	free(temp);
}
void print(){
	node* temp = front;
	if(temp==NULL){
		cout<<"empty queue"<<endl;
		return;
	}
	while(temp!= NULL){
		cout<<temp->data<<"  ";
		temp = temp->next;
	}
	cout<<endl;
}
int main(){
	enqueue(1);
	enqueue(2);
	enqueue(3);
	enqueue(4);
	enqueue(5);

	print();

	dequeue();
	print();

	enqueue(6);
	print();

	while(front!=NULL)
		dequeue();

	dequeue();
	print();

}