Scribd
Upload
26 views3 pages

Singly Linked Lists

Singly linked list is a linear data structure in which the elements are not stored in contiguous memory locations and each element is connected only to its next element using a pointer.

Uploaded by

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

Singly Linked Lists

Singly linked list is a linear data structure in which the elements are not stored in contiguous memory locations and each element is connected only to its next element using a pointer.

Uploaded by

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

2.

To create and manipulate singly linked lists in Java, including operations like insertion,
deletion, and searching.

//Singly Linked List


class LinkedList {
Node head;

// Create a node
class Node {
int data;
Node next;

Node(int d) {
data = d;
next = null;
}
}

// Insert at the beginning


public void insertAtBeginning(int new_data) {
// insert the data
Node new_node = new Node(new_data);
new_node.next = head;
head = new_node;
}

// Insert after a node


public void insertAfter(Node prev_node, int new_data) {
if (prev_node == null) {
System.out.println("The given previous node cannot be null");
return;
}
Node new_node = new Node(new_data);
new_node.next = prev_node.next;
prev_node.next = new_node;
}

// Insert at the end


public void insertAtEnd(int new_data) {
Node new_node = new Node(new_data);

if (head == null) {
head = new Node(new_data);
return;
}
new_node.next = null;

Node last = head;


while (last.next != null)
last = last.next;

last.next = new_node;
return;
}

// Delete a node
void deleteNode(int position) {
if (head == null)
return;

Node temp = head;

if (position == 0) {
head = temp.next;
return;
}
// Find the key to be deleted
for (int i = 0; temp != null && i < position - 1; i++)
temp = temp.next;

// If the key is not present


if (temp == null || temp.next == null)
return;

// Remove the node


Node next = temp.next.next;

temp.next = next;
}

// Search a node
boolean search(Node head, int key) {
Node current = head;
while (current != null) {
if (current.data == key)
return true;
current = current.next;
}
return false;
}
// Print the linked list
public void printList() {
Node tnode = head;
while (tnode != null) {
System.out.print(tnode.data + " ");
tnode = tnode.next;
}

public static void main(String[] args) {


LinkedList llist = new LinkedList();

llist.insertAtEnd(1);
llist.insertAtBeginning(2);
llist.insertAtBeginning(3);
llist.insertAtEnd(4);
llist.insertAfter(llist.head.next, 5);

System.out.println("Linked list: ");


llist.printList();

System.out.println("\nAfter deleting an element: ");


llist.deleteNode(3);
llist.printList();

System.out.println();
int item_to_find = 3;
if (llist.search(llist.head, item_to_find))
System.out.println(item_to_find + " is found");
else
System.out.println(item_to_find + " is not found");

}
}

You might also like