Scribd
Upload
3 views12 pages

Java Single Linked List Implementation

This document contains the code for a Java class that implements a single linked list data structure. The class includes methods for inserting and removing nodes from the list, getting a node's value, finding the index of a value, checking if the list is empty, and displaying the list. The main method creates an instance of the class and calls the execute method, which uses a menu driven interface to test the linked list methods.

Uploaded by

Kumar Narayanaswamy
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
3 views12 pages

Java Single Linked List Implementation

This document contains the code for a Java class that implements a single linked list data structure. The class includes methods for inserting and removing nodes from the list, getting a node's value, finding the index of a value, checking if the list is empty, and displaying the list. The main method creates an instance of the class and calls the execute method, which uses a menu driven interface to test the linked list methods.

Uploaded by

Kumar Narayanaswamy
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

import [Link].

*;
import [Link];
class Node
{
int value;
Node link;
Node()
{
value=0;
link=null;
}

class sll

int size,x, index;

Node header;
sll()

Scanner sc=new Scanner([Link]);

header=new Node();

[Link]("Enter header value:");

[Link]=[Link]();

[Link]=null;

size=1;

void insert(int index, int value)

if(index<0||index>=size)

throw new IllegalArgumentException("Enter


valid index");
}

if(index==0)

Node p= new Node();

[Link]=value;

[Link]=header;

header=p;

else

Node q= header;

for(int i=0;i<index-1;i++)

q=[Link];

[Link]=[Link];

[Link]=p;

}
size++;

int remove(int index)

if(header == null)

[Link]("Linked list is empty");

if(index<0||index>=size)

throw new IllegalArgumentException("Enter


valid index");

if(index==0)

x=[Link];
p=header;

header=[Link];

delete p;

else

p=header;

for(int i=0;i<index-1;i++)

p=[Link];

Node q=[Link];

x=[Link];

[Link]=[Link];

delete q;

return x;

}
int get(int index)

if(header==null)

[Link]("Single Linked List Empty");

if(index<0||index>=size)

throw new IllegalArgumentException("Enter


valid index");

Node p=header;

for(int i=0;i<index;i++)

p=[Link];

return [Link];

}
int indexOf(int value)

if(header==null)

[Link]("Single Linked List Empty");

if(index<0||index>=size)

throw new IllegalArgumentException("Enter


valid index");

int index=1;

Node p=header;

while(p!=null)

index++;

if([Link]==value)

return index;
p=[Link];

[Link]("Value Not Found...");

boolean isempty()

if(header==null)

return true;

else

return false; }

void display()

if(header==null)

[Link]("Single Linked List Empty");

Node p=header;

while(p!=null)
{

[Link]([Link]+"\t");

p=[Link];

void execute()

int index, value, ch;

Scanner sc=new Scanner([Link]);

do

[Link]("\n 1. Insert\n 2.
Remove\n 3. Get\n 4. IndexOf\n 5. IsEmpty\n
6. Display");

[Link]("Enter Your Choice:");

ch=[Link]();
switch(ch)

case 1: [Link]("Enter index and


value: ");

index=[Link]();

value=[Link]();

insert(index, value);

break;

case 2: [Link]("Enter index to be


Removed: ");

index=[Link]();

[Link]("Removed Element
is:"+remove(index));

break;

case 3: [Link]("Enter Index:");

index=[Link]();
[Link]("Value at
Index:"+index+"is"+get(index));

break;

case 4: [Link]("Enter value:");

value=[Link]();

[Link]("Index of Value
is:"+indexOf(value));

break;

case 5:

if(isempty())

[Link]("Single LinkedList is
Empty");

else

[Link]("Single LinkedList is Not


Empty");

break;

case 6: display();
break;

}while(ch>0&&ch<7);

public static void main(String args[])

sll s=new sll();

[Link]();

You might also like