-
Notifications
You must be signed in to change notification settings - Fork 5
/
LinkedQueue.java
executable file
·86 lines (75 loc) · 1.59 KB
/
LinkedQueue.java
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
package com.vee.algorithms.datastructures;
public class LinkedQueue<M extends Object> {
private Node<M> front;
private Node<M> rear;
private int size = -1;
public int getSize() {
return size;
}
public LinkedQueue() {
size = 0;
}
public boolean isEmpty() {
if (rear == null)
return true;
return false;
}
public M getFront() {
if(isEmpty())
return null;
return front.getData();
}
public M getRear() {
if(isEmpty())
return null;
return rear.getData();
}
public void display() {
Node<M> n = new Node<M>();
n = front;
while(n.getLink() != null) {
System.out.print(n.getData() + " ");
n = n.getLink();
}
System.out.println(n.getData());
}
public void enqueue(M data) {
Node<M> node = new Node<M>();
node.setData(data);
if(isEmpty()) {
rear = node;
front = rear;
size = 1;
return;
}
rear.setLink(node);
rear = node;
size++;
}
public M dequeue() {
if(isEmpty())
return null;
Node<M> oldNode = front;
front = front.getLink();
size--;
if(front == null)
rear = null;
return oldNode.getData();
}
public static void main(String args[]) {
LinkedQueue<Integer> ll = new LinkedQueue<Integer>();
ll.enqueue(1);
System.out.println(ll.getFront() +" " + ll.getRear());
ll.enqueue(2);
ll.enqueue(3);
ll.dequeue();
ll.enqueue(4);
System.out.println(ll.getFront() +" " + ll.getRear());
ll.dequeue();
System.out.println(ll.getFront() +" " + ll.getRear());
ll.dequeue();
System.out.println(ll.getFront() +" " + ll.getRear());
ll.enqueue(10);
System.out.println(ll.getFront() +" " + ll.getRear());
}
}