Linked List Data Structure Code Implementations
Production-ready Linked List Data Structure data structure implementations in C++, Python, Java, and JavaScript on AntInLoop.
Study Linked List Data Structure Guide ยท Launch Visualizer
CPP Implementation
#include <iostream>
using namespace std;
template <typename T>
class LinkedList {
private:
struct Node {
T data;
Node* next;
Node(T value) : data(value), next(nullptr) {}
};
Node* head;
int size;
public:
LinkedList() : head(nullptr), size(0) {}
~LinkedList() {
clear();
}
void push_front(T value) {
Node* newNode = new Node(value);
newNode->next = head;
head = newNode;
size++;
}
void push_back(T value) {
Node* newNode = new Node(value);
if (!head) {
head = newNode;
} else {
Node* current = head;
while (current->next) {
current = current->next;
}
current->next = newNode;
}
size++;
}
void insert(int index, T value) {
if (index < 0 || index > size) return;
if (index == 0) {
push_front(value);
return;
}
Node* newNode = new Node(value);
Node* current = head;
for (int i = 0; i < index - 1; i++) {
current = current->next;
}
newNode->next = current->next;
current->next = newNode;
size++;
}
bool remove(T value) {
if (!head) return false;
if (head->data == value) {
Node* temp = head;
head = head->next;
delete temp;
size--;
return true;
}
Node* current = head;
while (current->next && current->next->data != value) {
current = current->next;
}
if (current->next) {
Node* temp = current->next;
current->next = current->next->next;
delete temp;
size--;
return true;
}
return false;
}
T get(int index) {
if (index < 0 || index >= size) {
throw out_of_range("Index out of bounds");
}
Node* current = head;
for (int i = 0; i < index; i++) {
current = current->next;
}
return current->data;
}
bool contains(T value) {
Node* current = head;
while (current) {
if (current->data == value) return true;
current = current->next;
}
return false;
}
int length() { return size; }
bool empty() { return size == 0; }
void clear() {
while (head) {
Node* temp = head;
head = head->next;
delete temp;
}
size = 0;
}
void display() {
Node* current = head;
cout << "[";
while (current) {
cout << current->data;
if (current->next) cout << " -> ";
current = current->next;
}
cout << "]" << endl;
}
};JAVA Implementation
public class LinkedList<T> {
private class Node {
T data;
Node next;
Node(T data) {
this.data = data;
this.next = null;
}
}
private Node head;
private int size;
public LinkedList() {
head = null;
size = 0;
}
public void addFirst(T data) {
Node newNode = new Node(data);
newNode.next = head;
head = newNode;
size++;
}
public void addLast(T 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;
}
size++;
}
public void add(int index, T data) {
if (index < 0 || index > size) {
throw new IndexOutOfBoundsException("Index: " + index);
}
if (index == 0) {
addFirst(data);
return;
}
Node newNode = new Node(data);
Node current = head;
for (int i = 0; i < index - 1; i++) {
current = current.next;
}
newNode.next = current.next;
current.next = newNode;
size++;
}
public boolean remove(T data) {
if (head == null) return false;
if (head.data.equals(data)) {
head = head.next;
size--;
return true;
}
Node current = head;
while (current.next != null && !current.next.data.equals(data)) {
current = current.next;
}
if (current.next != null) {
current.next = current.next.next;
size--;
return true;
}
return false;
}
public T get(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException("Index: " + index);
}
Node current = head;
for (int i = 0; i < index; i++) {
current = current.next;
}
return current.data;
}
public boolean contains(T data) {
Node current = head;
while (current != null) {
if (current.data.equals(data)) return true;
current = current.next;
}
return false;
}
public int size() { return size; }
public boolean isEmpty() { return size == 0; }
public void clear() {
head = null;
size = 0;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append("[");
Node current = head;
while (current != null) {
sb.append(current.data);
if (current.next != null) sb.append(" -> ");
current = current.next;
}
sb.append("]");
return sb.toString();
}
}JAVASCRIPT Implementation
class LinkedList {
constructor() {
this.head = null;
this.size = 0;
}
// Add element to the beginning
prepend(data) {
const newNode = { data, next: this.head };
this.head = newNode;
this.size++;
}
// Add element to the end
append(data) {
const newNode = { data, next: null };
if (!this.head) {
this.head = newNode;
} else {
let current = this.head;
while (current.next) {
current = current.next;
}
current.next = newNode;
}
this.size++;
}
// Insert at specific index
insert(index, data) {
if (index < 0 || index > this.size) {
throw new Error('Index out of bounds');
}
if (index === 0) {
this.prepend(data);
return;
}
const newNode = { data, next: null };
let current = this.head;
for (let i = 0; i < index - 1; i++) {
current = current.next;
}
newNode.next = current.next;
current.next = newNode;
this.size++;
}
// Remove first occurrence of data
remove(data) {
if (!this.head) return false;
if (this.head.data === data) {
this.head = this.head.next;
this.size--;
return true;
}
let current = this.head;
while (current.next && current.next.data !== data) {
current = current.next;
}
if (current.next) {
current.next = current.next.next;
this.size--;
return true;
}
return false;
}
// Get element at index
get(index) {
if (index < 0 || index >= this.size) {
throw new Error('Index out of bounds');
}
let current = this.head;
for (let i = 0; i < index; i++) {
current = current.next;
}
return current.data;
}
// Check if list contains data
contains(data) {
let current = this.head;
while (current) {
if (current.data === data) return true;
current = current.next;
}
return false;
}
// Get size
length() {
return this.size;
}
// Check if empty
isEmpty() {
return this.size === 0;
}
// Clear the list
clear() {
this.head = null;
this.size = 0;
}
// Convert to array
toArray() {
const result = [];
let current = this.head;
while (current) {
result.push(current.data);
current = current.next;
}
return result;
}
// String representation
toString() {
if (!this.head) return '[]';
let result = '[';
let current = this.head;
while (current) {
result += current.data;
if (current.next) result += ' -> ';
current = current.next;
}
result += ']';
return result;
}
}PYTHON Implementation
class LinkedList:
class Node:
def __init__(self, data):
self.data = data
self.next = None
def __init__(self):
self.head = None
self.size = 0
def prepend(self, data):
"""Add element to the beginning"""
new_node = self.Node(data)
new_node.next = self.head
self.head = new_node
self.size += 1
def append(self, data):
"""Add element to the end"""
new_node = self.Node(data)
if not self.head:
self.head = new_node
else:
current = self.head
while current.next:
current = current.next
current.next = new_node
self.size += 1
def insert(self, index, data):
"""Insert at specific index"""
if index < 0 or index > self.size:
raise IndexError("Index out of bounds")
if index == 0:
self.prepend(data)
return
new_node = self.Node(data)
current = self.head
for i in range(index - 1):
current = current.next
new_node.next = current.next
current.next = new_node
self.size += 1
def remove(self, data):
"""Remove first occurrence of data"""
if not self.head:
return False
if self.head.data == data:
self.head = self.head.next
self.size -= 1
return True
current = self.head
while current.next and current.next.data != data:
current = current.next
if current.next:
current.next = current.next.next
self.size -= 1
return True
return False
def get(self, index):
"""Get element at index"""
if index < 0 or index >= self.size:
raise IndexError("Index out of bounds")
current = self.head
for i in range(index):
current = current.next
return current.data
def contains(self, data):
"""Check if list contains data"""
current = self.head
while current:
if current.data == data:
return True
current = current.next
return False
def __len__(self):
"""Get size"""
return self.size
def is_empty(self):
"""Check if empty"""
return self.size == 0
def clear(self):
"""Clear the list"""
self.head = None
self.size = 0
def to_list(self):
"""Convert to Python list"""
result = []
current = self.head
while current:
result.append(current.data)
current = current.next
return result
def __str__(self):
"""String representation"""
if not self.head:
return "[]"
result = "["
current = self.head
while current:
result += str(current.data)
if current.next:
result += " -> "
current = current.next
result += "]"
return result
def __iter__(self):
"""Make the list iterable"""
current = self.head
while current:
yield current.data
current = current.next