0% found this document useful (0 votes)
11 views

Linked List

Uploaded by

angelinapg2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as RTF, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views

Linked List

Uploaded by

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

Linked List

import java.util.Scanner;
class LinkedList
{
private Node head;
class Node
{
private int data;
private Node left;
private Node right;
public Node(int data)
{
this.data=data;
this.left=null;
this.right=null;
}
}
public void insert(int data)
{
Node temp=new Node(data);
if(head==null)
{
head=temp;
}
else
{
Node ptr=head;
while(ptr.right!=null)
{
ptr=ptr.right;
}
ptr.right=temp;
temp.left=ptr;
}
}
public void delete()
{
int x=head.data;
head=head.right;
head.left=null;
System.out.println("Element "+x+" got deleted.");
}
public void display()
{
if(head==null)
System.out.println("List is empty.");
else
{
Node ptr=head;
while(ptr!=null)
{
System.out.println(ptr.data +"\t");
ptr=ptr.right;
}
System.out.println();
}
}
}

class ll
{
public static void main(String args[])
{
LinkedList list=new LinkedList();
Scanner sc=new Scanner(System.in);
String choice="";
while(!choice.equals("4"))
{
System.out.print("1.Insert at end \n2.Delete from front \n3.Display \n4.Exit \n");
System.out.println("Enter the choice: ");
choice=sc.nextLine();
switch(choice)
{
case "1": System.out.println("Enter the number to insert: ");
int data=sc.nextInt();
sc.nextLine();
list.insert(data);
System.out.println("Data inserted successfully.");
break;
case "2": list.delete();
break;
case "3": list.display();
break;
case "4": break;
default: System.out.print("Invalid Choice");
}
}
}
}

Output:

You might also like