-
Notifications
You must be signed in to change notification settings - Fork 2
/
LListqueue.java
73 lines (72 loc) · 1.6 KB
/
LListqueue.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
class Node{
int data;
Node next;
Node(int data){
this.data=data;
}
}
public class LListqueue {
Node head,front,rear;
void enqueue(int x){
Node newNode=new Node(x);
/*if(head==null){
head=newNode;
}
else{
Node temp=head;
while(temp.next!=null)
temp=temp.next;
temp.next=newNode;
}*/
if(front==null){
front=newNode;
rear=front;
}
else{
rear.next=newNode;
rear=newNode;
}
}
int dequeue(){
/*if(head!=null){
Node temp=head;
int x=temp.data;
head=temp.next;
return x;
}
else{
System.out.println("UnderFlow");
return -1;
}*/
int x=front.data;
front=front.next;
return x;
}
void display(){
/*Node temp=head;
if(head!=null){
while(temp!=null){
System.out.print(temp.data+" ");
temp=temp.next;
}
System.out.println();
}*/
Node temp=front;
while(temp!=rear){
System.out.print(temp.data+" ");
temp=temp.next;
}
System.out.println();
}
public static void main(String[] args) {
LList n = new LList();
n.enqueue(10);
n.enqueue(20);
n.enqueue(30);
n.enqueue(40);
n.enqueue(50);
n.display();
System.out.println("Dq "+n.dequeue());
n.display();
}
}