forked from gcsrilanka/Algorithm-Collection
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue.java
More file actions
Latest commit
95 lines (72 loc) · 1.38 KB
/
Copy pathQueue.java
File metadata and controls
95 lines (72 loc) · 1.38 KB
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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
publicclassQueue {
privateQueueNodefront;
privateQueueNodeback;
Queue(){
this.front = null;
this.back = null;
}
booleanisEmpty() {
if(this.front == null) {
returntrue;
}else {
returnfalse;
}
}
voidenqueue(intdata) {
QueueNodenewNode = newQueueNode(data);
if(isEmpty()) {
this.front = newNode;
this.back = newNode;
}else {
this.back.setNext(newNode);
this.back = newNode;
}
}
intdequeue() {
if(isEmpty()) {
return0;
}else {
QueueNodetemp = this.front;
this.front = this.front.getNext();
if(this.front == null) {
this.back = null;
}
returntemp.getData();
}
}
voidpeek() {
if(isEmpty()) {
System.out.println("Empty Queue");
}else {
System.out.println(this.front.getData());
}
}
voidprint() {
QueueNodetemp = this.front;
while(!isEmpty()) {
System.out.print(dequeue() +" ");
temp = temp.getNext();
}
}
}
classQueueNode {
//you can define any type of data in here
privateintdata;
privateQueueNodenext;
QueueNode(intdata){
this.data = data;
this.next = null;
}
publicintgetData() {
returndata;
}
publicvoidsetData(intdata) {
this.data = data;
}
publicQueueNodegetNext() {
returnnext;
}
publicvoidsetNext(QueueNodenext) {
this.next = next;
}
}