Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
66 lines (53 loc) · 1.3 KB

File metadata and controls

66 lines (53 loc) · 1.3 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
// This program implements a queue using a linked list
class Node {
// Represents a node in the linked list
int data;
Node next;
Node(int data) {
this.data = data;
next = null;
}
}
class LinkedListQueue {
Node front, rear;
void enqueue(int data) {
Node newNode = new Node(data);
if (rear == null) {
front = rear = newNode;
return;
}
rear.next = newNode;
rear = newNode;
}
int dequeue() {
if (front == null) {
return -1;
}
int val = front.data;
front = front.next;
if (front == null) {
rear = null;
}
return val;
}
int peek() {
if (front == null) {
return -1;
}
return front.data;
}
boolean isEmpty() {
return front == null;
}
}
public class Program106 {
public static void main(String[] args) {
LinkedListQueue queue = new LinkedListQueue();
queue.enqueue(10);
queue.enqueue(20);
queue.enqueue(30);
System.out.println(queue.dequeue()); // 10
System.out.println(queue.peek()); // 20
System.out.println(queue.isEmpty()); // false
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.