[go: up one dir, main page]
Scribd
Upload
10 views3 pages

LinkedList Full Java Implementation Yaswin

The document explains the concept of a linked list in Java, highlighting its dynamic nature and advantages over arrays. It provides a full implementation of a LinkedList class with methods for insertion, display, reversal, and finding the middle element. The main class demonstrates how to use these methods effectively.

Uploaded by

hykgamers
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
10 views3 pages

LinkedList Full Java Implementation Yaswin

The document explains the concept of a linked list in Java, highlighting its dynamic nature and advantages over arrays. It provides a full implementation of a LinkedList class with methods for insertion, display, reversal, and finding the middle element. The main class demonstrates how to use these methods effectively.

Uploaded by

hykgamers
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

Linked List in Java - Full Implementation with Explanation

What is Linked List?


A linked list is a dynamic data structure with nodes containing data and a pointer to the next node. It allows
easy insertion and deletion without shifting elements like arrays.

Node Class
class Node {
int data;
Node next;
Node(int data) {
this.data = data;
this.next = null;
}
}

LinkedList Class with Insert, Display, Reverse, and Find Middle


class LinkedList {
Node head;

public void insertAtEnd(int data) {


Node newNode = new Node(data);
if (head == null) {
head = newNode;
} else {
Node current = head;
while (current.next != null) {
current = current.next;
}
current.next = newNode;
}
}

public void insertAtBeginning(int data) {


Node newNode = new Node(data);
newNode.next = head;
head = newNode;
}

public void display() {


Node current = head;
while (current != null) {
System.out.print(current.data + ' ');
current = current.next;
}
}

public void reverse() {


Node prev = null;
Node current = head;
Node next = null;
while (current != null) {
next = current.next;
current.next = prev;
prev = current;
current = next;
}
head = prev;
}

public void findMiddle() {


Node slow = head;
Node fast = head;
while (fast != null && fast.next != null) {
slow = slow.next;
fast = fast.next.next;
}
if (slow != null) {
System.out.println('Middle element: ' + slow.data);
}
}
}

Main Class for Testing


public class Simple {
public static void main(String[] args) {
LinkedList l = new LinkedList();
l.insertAtEnd(3);
l.insertAtEnd(5);
l.insertAtBeginning(1);
l.display(); // prints: 1 3 5
l.reverse();
l.display(); // prints: 5 3 1
l.findMiddle(); // prints: Middle element: 3
}
}

Summary:
- Node class stores data and next pointer.
- LinkedList class manages insertion at beginning/end, display, reverse, and finding
middle.
- Practice these methods for linked list mastery in Java DSA.

You might also like