class node
{
public int x;
public node next;
}
class CircularQueue
{
public node front,rear;
CircularQueue()
{
front=rear=null;
}
void insert (int v)
{
node temp=new node();
temp.x=v;
if(front==null)
front=rear=temp;
else
{
rear.next=temp;
rear=temp;
}
rear.next=front;
}
int del()
{
if(front==null)
{
System.out.println("Queue UnderFlow");
System.exit(1);
}
int v=front.x;
node temp=front;
if(front==rear)
front=rear=null;
else
{
front=front.next;
rear.next=front;
}
temp=null;
return v;
}
void show()
{
System.out.println("\nCircular Queue Elements:");
for(node ptr=front;ptr!=rear;ptr=ptr.next)
System.out.print("\t"+ptr.x);
System.out.print("\t"+rear.x);
}
}
class CQueueTest
{
public static void main(String as[]) throws Exception
{
CircularQueue q1=new CircularQueue();
q1.insert(30);
q1.insert(40);
q1.insert(50);
q1.insert(60);
q1.show();
System.out.println("\nDeleted Element:"+q1.del());
System.out.println("\nAfter Deleting");
q1.show();
}
}
/* Output: */
Circular Queue Elements:
30 40 50 60
Deleted Element:30
After Deleting
Circular Queue Elements:
40 50 60
0 comments:
Post a Comment