class queue{
node front;
node rear;
class node{
int data;
node next;
node(int data){
this.data = data;
this.next = null;
}
}
void enq(int data){
System.out.println("your are adding data "+data);
node cur = new node(data);
if(front ==null && rear ==null){
front = cur;
rear = front.next;
}
else{
if(rear == null){
front.next = cur;
rear = cur;
return;
}
rear = rear.next = cur;
}
}
void deq(){
if(front ==null && rear ==null){
System.out.println("queue is empty");
}
else{
System.out.println("you are deleting "+front.data);
front = front.next;
}
}
void print(){
node temp = front;
if(front == null && rear == null){
System.out.println("there is nothing to print");
}
else{
System.out.println("your data is ");
while(temp !=null){
System.out.print(temp.data+" ");
temp = temp.next;
}
System.out.println();
}
}
public static void main(String ar[]){
queue q1 = new queue();
q1.enq(90);
q1.enq(100);
q1.print();
q1.enq(777);
q1.enq(999);
q1.deq();
q1.print();
}
}
Comments
Post a Comment