How to create linked list?
Last Updated :
26 Jul, 2025
In this article, we will explore the process of creating a linked list. A linked list consists of nodes, each containing data and a reference to the next node. We will walk through the steps of defining the node structure, initializing the head of the list, creating new nodes, and linking these nodes to form the list. By the end of this article, you will have a clear understanding of how to implement a linked list.
LinkedList Structure
A LinkedList is a linear data structure where each element is a separate object called a node. Each node contains two fields: one for data and one for the reference to the next node. The first node is called the head. If the LinkedList is empty, the head is a null reference.
How to create linked list?
A linked list is a dynamic data structure that consists of nodes. Each node contains two fields: one for storing data and the other for storing the address of the next node in the list.
Here’s how you can create a linked list:
Step 1: Define the Node Structure
First, we need to define the structure of a node in the linked list. Each node will contain some data and a pointer to the next node.
C++
struct Node {
int data; // The data stored in the node
Node* next; // Pointer to the next node
};
class Node {
int data; // The data stored in the node
Node next; // Pointer to the next node
}
class Node:
def __init__(self, data):
self.data = data # The data stored in the node
self.next = None # Pointer to the next node
class Node {
constructor(data) {
this.data = data; // The data stored in the node
this.next = null; // Pointer to the next node
}
}
Step 2: Initialize the Head of the List
The head of the list is the first node in the list. Initially, the list is empty, so the head is a null pointer.
C++
Step 3: Create New Nodes
To add elements to the list, we create new nodes. Each new node should be dynamically allocated using the new keyword.
C++
Node* newNode = new Node();
Node newNode = new Node();
let newNode = new Node();
After creating a new node, we can set the data field and initialize the next pointer to null.
C++
newNode->data = 1; // Replace 1 with the actual data
newNode->next = nullptr;
newNode.data = 1; // Replace 1 with the actual data
newNode.next = null;
newNode.data = 1 # Replace 1 with the actual data
newNode.next = None
newNode.data = 1; // Replace 1 with the actual data
newNode.next = null;
Step 4: Link the Nodes
If the list is not empty, we need to traverse the list to find the last node and update its next pointer.
C++
if (head == nullptr) {
// The list is empty, so the new node is the head of the list
head = newNode;
} else {
// The list is not empty, traverse the list to find the last node
Node* temp = head;
while (temp->next != nullptr) {
temp = temp->next;
}
// Now temp points to the last node, link the new node
temp->next = newNode;
}
if (head == null) {
// The list is empty, so the new node is the head of the list
head = newNode;
} else {
// The list is not empty, traverse the list to find the last node
Node temp = head;
while (temp.next != null) {
temp = temp.next;
}
// Now temp points to the last node, link the new node
temp.next = newNode;
}
if head is None:
# The list is empty, so the new node is the head of the list
head = newNode
else:
# The list is not empty, traverse the list to find the last node
temp = head
while temp.next is not None:
temp = temp.next
# Now temp points to the last node, link the new node
temp.next = newNode
#this code ios cpntributed by MOnu.
if (head === null) {
// The list is empty, so the new node is the head of the list
head = newNode;
} else {
// The list is not empty, traverse the list to find the last node
let temp = head;
while (temp.next !== null) {
temp = temp.next;
}
// Now temp points to the last node, link the new node
temp.next = newNode;
}
Complete Implemenatation LinkedList:
C++
#include <bits/stdc++.h>
using namespace std;
// Define the Node structure
struct Node {
int data; // The data stored in the node
Node* next; // Pointer to the next node
};
int main()
{
// Initialize the head of the list
Node* head = nullptr;
// Create new nodes and add them to the list
for (int i = 1; i <= 5; i++) {
Node* newNode = new Node();
newNode->data = i; // Replace i with the actual data
newNode->next = nullptr;
// Link the nodes
if (head == nullptr) {
// The list is empty, so the new node is the
// head of the list
head = newNode;
}
else {
// The list is not empty, traverse the list to
// find the last node
Node* temp = head;
while (temp->next != nullptr) {
temp = temp->next;
}
// Now temp points to the last node, link the
// new node
temp->next = newNode;
}
}
// Print the list
Node* temp = head;
while (temp != nullptr) {
cout << temp->data << " ";
temp = temp->next;
}
cout << endl;
// Free up the memory
while (head != nullptr) {
Node* temp = head;
head = head->next;
delete temp;
}
return 0;
}
// Import necessary libraries
import java.util.*;
// Define the Node class
class Node {
int data; // The data stored in the node
Node next; // Reference to the next node
// Node constructor
public Node(int data) {
this.data = data;
this.next = null;
}
}
public class Main {
public static void main(String[] args) {
// Initialize the head of the list
Node head = null;
// Create new nodes and add them to the list
for (int i = 1; i <= 5; i++) {
Node newNode = new Node(i); // Replace i with the actual data
// Link the nodes
if (head == null) {
// The list is empty, so the new node is the
// head of the list
head = newNode;
} else {
// The list is not empty, traverse the list to
// find the last node
Node temp = head;
while (temp.next != null) {
temp = temp.next;
}
// Now temp points to the last node, link the
// new node
temp.next = newNode;
}
}
// Print the list
Node temp = head;
while (temp != null) {
System.out.print(temp.data + " ");
temp = temp.next;
}
System.out.println();
// No explicit memory deallocation is needed in Java
// The Java Garbage Collector will automatically free up the memory
}
}
# Define the Node class
class Node:
def __init__(self, data=None):
self.data = data # The data stored in the node
self.next = None # Pointer to the next node
# Initialize the head of the list
head = None
# Create new nodes and add them to the list
for i in range(1, 6):
new_node = Node(i) # Replace i with the actual data
# Link the nodes
if head is None:
# The list is empty, so the new node is the
# head of the list
head = new_node
else:
# The list is not empty, traverse the list to
# find the last node
temp = head
while temp.next is not None:
temp = temp.next
# Now temp points to the last node, link the
# new node
temp.next = new_node
# Print the list
temp = head
while temp is not None:
print(temp.data, end=" ")
temp = temp.next
print()
// Define the Node class
class Node {
constructor(data) {
this.data = data; // The data stored in the node
this.next = null; // Pointer to the next node
}
}
// Main function
function main() {
// Initialize the head of the list
let head = null;
// Create new nodes and add them to the list
for (let i = 1; i <= 5; i++) {
let newNode = new Node(i); // Replace i with the actual data
// Link the nodes
if (head === null) {
// The list is empty, so the new node is the head of the list
head = newNode;
} else {
// The list is not empty, traverse the list to find the last node
let temp = head;
while (temp.next !== null) {
temp = temp.next;
}
// Now temp points to the last node, link the new node
temp.next = newNode;
}
}
// Print the list
let temp = head;
let listStr = "";
while (temp !== null) {
listStr += temp.data + " ";
temp = temp.next;
}
console.log(listStr.trim());
// Free up the memory
while (head !== null) {
let temp = head;
head = head.next;
temp = null;
}
}
// Call the main function
main();
Conclusion
Creating a LinkedList involves several steps: defining the Node structure, initializing the LinkedList, and implementing methods to add and traverse nodes. While the implementation can vary depending on the programming language, the fundamental concepts remain the same. Understanding these steps is crucial for anyone learning data structures and algorithms.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem