-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue.java
More file actions
91 lines (86 loc) · 2.04 KB
/
Queue.java
File metadata and controls
91 lines (86 loc) · 2.04 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
import java.util.*;
class Queue
{
Node front, rear;
int size;
Queue()
{
front = null;
rear = null;
size = 0;
}
void Insert(int n)
{
Node N = new Node(n);
size++;
if (front == null)
{
front = N;
rear = front;
}
else
{
rear.next = N;
rear = rear.next;
}
}
void Delete()
{
if (front == null)
{
System.out.println("List empty");
return;
}
size--;
System.out.println("Deleted item: " + front.n);
front = front.next;
if (front == null)
rear = null;
}
void Display()
{
if (front == null)
System.out.print("List empty");
Node ptr = front;
while (ptr != null)
{
System.out.print(ptr.n + "\t");
ptr = ptr.next;
}
System.out.println();
}
public static void main()
{
Scanner sc = new Scanner(System.in);
Queue Q = new Queue();
System.out.println("1. Insert\n 2. Delete\n 3. Display\n 4. Display Size\n 5. Quit");
int ch;
do
{
System.out.println("Make choice:");
ch = sc.nextInt();
switch (ch)
{
case 1:
System.out.println("Enter item:");
int x = sc.nextInt();
Q.Insert(x);
break;
case 2:
Q.Delete();
break;
case 3:
Q.Display();
break;
case 4:
System.out.println("Size of queue is " + Q.size);
break;
case 5:
System.out.println("Quitting program");
break;
default:
System.out.println("Invalid: Choose again");
}
}while (ch != 5);
}
}