//SOUVIK & SOUMODIP

A program to implement a linked queue that can push,pop & peep elements.

class Node
{
protected int data;
protected Node link;
public Node()
{
data=0;
link=null;
}
public Node(int d,Node n)
{
data =d;
link=n;
}
public void setLink(Node n)
{
link=n;
}
public void setData(int d)
{
data=d;
}
public Node getLink()
{
return link;
}
public int getData()
{
return data;
}
}
class linkedQueue
{
public Node front,rear;
public int number;
public linkedQueue()
{
front=rear=null;
number=0;
}
public boolean isEmpty()
{
return front==null;
}
public int size()
{
return number;
}
public void Insert(int obj)
{
Node tmp;
tmp=new Node(obj,null);
if(rear==null)
front=rear=tmp;
else
{
rear.setLink(tmp);
rear.getLink();
}
number++;
}
public int Remove()
{
if(isEmpty()==true)
return 0;
Node tmp=front;
front=tmp.getLink();
if(front==null)
number--;
return tmp.getData();
}
public int peep()
{
if(isEmpty()==true)
return 0;
return front.getData();
}
}

import java.io.*;
public class use_Link_Queue
{
public static void main()throws IOException
{
linkedQueue s=new linkedQueue();
BufferedReader br=new BufferedReader(new
InputStreamReader(System.in));
int res=0;
while(true)
{
System.out.println("Enter your choice");
System.out.println("Enter 1. to push");
System.out.println("Enter 2. to pop");
System.out.println("Enter 3. to peep");
System.out.println("Enter 4. to display the size");
System.out.println("Enter 5. to exit");
int ch=Integer.parseInt(br.readLine());
if(ch==1)
{
System.out.print("Enter a number: ");
int n=Integer.parseInt(br.readLine());
s.Insert(n);
System.out.println("The pushed element is: "+n);
}
else if(ch==2)
{
res=s.Remove();
if(res!=0)
System.out.println(res+" Deleted successfully. ");
else
System.out.println("The queue is empty!!");}
else if(ch==3)
{
res=s.peep();
if(res!=0)
System.out.println("The top element:"+res);
else
System.out.println("The queue is empty!!");}
else if(ch==4)
{
res=s.size();
System.out.println("The size of the list is now : "+res);
}
else if(ch==5)
break;
else
System.out.println("Sorry no option for your choice");
}
}
}
SAMPLE OUTPUT:

Enter your choice

Enter 1. to insert
Enter 2. to remove
Enter 3. to peep
Enter 4. to display the size
Enter 5. to exit
1
Enter a number: 3
The inserted element is: 3
Enter your choice
Enter 1. to insert
Enter 2. to remove
Enter 3. to peep
Enter 4. to display the size
Enter 5. to exit
1
Enter a number: 4
The inserted element is: 4
Enter your choice
Enter 1. to insert
Enter 2. to remove
Enter 3. to peep
Enter 4. to display the size
Enter 5. to exit
1
Enter a number: 5
The inserted element is: 5
Enter your choice
Enter 1. to insert
Enter 2. to remove
Enter 3. to peep
Enter 4. to display the size
Enter 5. to exit
2
3 removed successfully.
Enter your choice
Enter 1. to insert
Enter 2. to remove
Enter 3. to peep
Enter 4. to display the size
Enter 5. to exit
3
The top element:5
Enter your choice
Enter 1. to insert
Enter 2. to remove
Enter 3. to peep
Enter 4. to display the size
Enter 5. to exit
4
The size of the list is now : 3
Enter your choice
Enter 1. to insert
Enter 2. to remove
Enter 3. to peep
Enter 4. to display the size
Enter 5. to exit
5