File size: 1,079 Bytes
c574d3a |
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 |
// Queue implementation using the linkedlist representation
class QueueLL{
static Node front = null,rear = null;
static class Node{
int data;
Node next;
}
void enqueue(int x){
Node temp = new Node();
if(temp == null){
System.out.println("Overflow");
}
else{
temp.data = x;
temp.next = null;
if(front==null){
front = temp;
rear = temp;
}
else{
rear.next = temp;
rear= temp;
}
}
}
void dequeue(){
Node temp;
if(front == null){
System.out.println("underflow!");
}
else{
int x = front.data;
temp = front;
front = front.next;
System.out.println(x+" Dequeued!");
}
}
void Display(){
Node n = front;
while(n!=null){
System.out.print(n.data+" ");
n = n.next;
}
}
public static void main(String[] args){
QueueLL q = new QueueLL();
q.enqueue(4);
q.enqueue(3);
q.enqueue(5);
q.enqueue(6);
q.dequeue();
q.Display();
}
}
|