Scribd
Upload
12 views4 pages

DSA2

Uploaded by

unknownguy1805
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views4 pages

DSA2

Uploaded by

unknownguy1805
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

DSA LAB ASSIGNMENT 2

Implementation of Queue using Linked List.

CODE
import java.util.*;
class QueueWithLL
{
static class Node
{
int data;
Node next;
Node(int data)
{
this.data=data;
this.next=null;
}
}

Node front, rear;

void enqueue(int data)


{
Node newNode=new Node(data);
if(rear==null)
{
front=rear=newNode;
}
else
{
rear.next=newNode;
rear=newNode;
}
}
void dequeue()
{
if(front==null)
{
System.out.println("Queue is empty");
}
else
{
int data=front.data;
front=front.next;
if(front==null)
{
rear=null;
}
System.out.println("Dequeued element: "+data);
}
}

void display()
{
if(front==null)
{
System.out.println("Queue is empty");
}
else
{
Node curr=front;
while(curr!=null)
{
System.out.print(curr.data+" ");
curr=curr.next;
}
System.out.println();
}
}

public static void main(String args[])


{
QueueWithLL q=new QueueWithLL();
Scanner sc=new Scanner(System.in);

while(true)
{
System.out.println("1.Enqueue, 2.Dequeue, 3.Display, 4.Exit");
System.out.print("Enter choice: ");
int ch=sc.nextInt();

switch(ch)
{
case 1:
System.out.print("Enter data to enqueue: ");
int data=sc.nextInt();
q.enqueue(data);
break;
case 2:
q.dequeue();
break;
case 3:
q.display();
break;
case 4:
System.exit(0);
default:
System.out.println("Invalid choice");
}
}
}
}
OUTPUT

You might also like