-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue_Using_LL.java
More file actions
72 lines (59 loc) · 1.45 KB
/
Copy pathQueue_Using_LL.java
File metadata and controls
72 lines (59 loc) · 1.45 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
public class Queue_Using_LL {
static class Node{
int data;
Node next;
Node(int data){
this.data = data;
this.next = null;
}
}
static class Queue{
static Node head = null;
static Node tail = null;
public boolean isEmpty(){
return head == null && tail == null;
}
public void add(int data){
Node newNode = new Node(data);
if(head == null){
head = tail = newNode;
return;
}
tail.next = newNode;
tail = newNode;
}
public int remove(){
if(isEmpty()){
System.out.println("EMpty ll");
return -1;
}
int front = head.data;
if(head == tail){
head = tail = null;
}
else{
head = head.next;
}
return front;
}
public int peek(){
if(isEmpty()){
System.out.println("Empty queue");
return -1;
}
return head.data;
}
}
public static void main(String[] args) {
Queue q = new Queue();
q.add(1);
q.add(2);
//q.remove();
q.add(23);
//q.remove();
while(!q.isEmpty()){
System.out.println(q.peek());
q.remove();
}
}
}