9/21/23, 10:46 PM Understanding the basics of Linked List - GeeksforGeeks

Understanding the basics of Linked List

Read Discuss(130+) Courses Practice Video

Linked List is a linear data structure, in which elements are not stored at a
contiguous location, rather they are linked using pointers. Linked List forms a series
of connected nodes, where each node stores the data and the address of the next
node.

Node Structure: A node in a linked list typically consists of two components:

Data: It holds the actual value or data associated with the node.
Next Pointer: It stores the memory address (reference) of the next node in the sequence.
Head and Tail: The linked list is accessed through the head node, which points to the first
node in the list. The last node in the list points to NULL or nullptr, indicating the end of
the list. This node is known as the tail node.

Why linked list data structure needed?

Here are a few advantages of a linked list that is listed below, it will help you understand
why it is necessary to know.

We use cookies to ensure you have the best browsing experience on our website. By using our Got It !
site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
DSA Classroom Course DSA for Beginners DSA Tutorial Data Structures Algorithms Array Strings Lin
https://www.geeksforgeeks.org/what-is-linked-list/ 1/8
9/21/23, 10:46 PM Understanding the basics of Linked List - GeeksforGeeks
DSA Classroom Course DSA for Beginners DSA Tutorial Data Structures Algorithms Array Strings Lin
OFFLINE MERN Full Stack Web Development -
Classroom Program
Join our 2-month MERN stack program and gain a
competitive edge with our internship certificate and
job assistance.

Real-Time Job
Projects Assistance

Internship Certificate LEARN MORE

Dynamic Data structure: The size of memory can be allocated or de-allocated at run
time based on the operation insertion or deletion.
Ease of Insertion/Deletion: The insertion and deletion of elements are simpler than
arrays since no elements need to be shifted after insertion and deletion, Just the
address needed to be updated.
Efficient Memory Utilization: As we know Linked List is a dynamic data structure the
size increases or decreases as per the requirement so this avoids the wastage of
memory.
Implementation: Various advanced data structures can be implemented using a linked
list like a stack, queue, graph, hash maps, etc.

Example:

In a system, if we maintain a sorted list of IDs in an array id[] = [1000, 1010, 1050,
2000, 2040].

If we want to insert a new ID 1005, then to maintain the sorted order, we have to
move all the elements after 1000 (excluding 1000).

Deletion is also expensive with arrays until unless some special techniques are
used. For example, to delete 1010 in id[], everything after 1010 has to be moved
due to this so much work is being done which affects the efficiency of the code.

Types of linked lists:

There are mainly three types of linked lists:

1. Single-linked list
2. Double linked list
We use cookies to ensure you have the best browsing experience on our website. By using our
3.site,
Circular linked list
you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

https://www.geeksforgeeks.org/what-is-linked-list/ 2/8
9/21/23, 10:46 PM Understanding the basics of Linked List - GeeksforGeeks

1. Single-linked list:

In a singly linked list, each node contains a reference to the next node in the sequence.
Traversing a singly linked list is done in a forward direction.

Single-linked list

2. Double-linked list:

In a doubly linked list, each node contains references to both the next and previous nodes.
This allows for traversal in both forward and backward directions, but it requires
additional memory for the backward reference.

Double-linked list

3. Circular linked list:

In a circular linked list, the last node points back to the head node, creating a circular
structure. It can be either singly or doubly linked.

Circular linked list

Operations on
We use cookies to ensure youLinked Listsexperience on our website. By using our
have the best browsing
site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

https://www.geeksforgeeks.org/what-is-linked-list/ 3/8
9/21/23, 10:46 PM Understanding the basics of Linked List - GeeksforGeeks

1. Insertion: Adding a new node to a linked list involves adjusting the pointers of the
existing nodes to maintain the proper sequence. Insertion can be performed at the
beginning, end, or any position within the list
2. Deletion: Removing a node from a linked list requires adjusting the pointers of the
neighboring nodes to bridge the gap left by the deleted node. Deletion can be
performed at the beginning, end, or any position within the list.
3. Searching: Searching for a specific value in a linked list involves traversing the list
from the head node until the value is found or the end of the list is reached.

Advantages of Linked Lists

Dynamic Size: Linked lists can grow or shrink dynamically, as memory allocation is
done at runtime.
Insertion and Deletion: Adding or removing elements from a linked list is efficient,
especially for large lists.
Flexibility: Linked lists can be easily reorganized and modified without requiring a
contiguous block of memory.

Disadvantages of Linked Lists

Random Access: Unlike arrays, linked lists do not allow direct access to elements by
index. Traversal is required to reach a specific node.
Extra Memory: Linked lists require additional memory for storing the pointers,
compared to arrays.

Conclusion:
Linked lists are versatile data structures that provide dynamic memory allocation and
efficient insertion and deletion operations. Understanding the basics of linked lists is
essential for any programmer or computer science enthusiast. With this knowledge, you
can implement linked lists to solve various problems and expand your understanding of
data structures and algorithms.
Last Updated : 07 Jun, 2023 3.30k

Similar Reads
XOR Linked List – A Memory Merge a linked list into another
Efficient Doubly Linked List | Set linked list at alternate positions
2

Check if a linked list is Circular Convert singly linked list into

Linked List circular linked list
We use cookies to ensure you have the best browsing experience on our website. By using our
site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

https://www.geeksforgeeks.org/what-is-linked-list/ 4/8