PPT: Linked Lists | Programming and Data Structures - Computer Science Engineering (CSE) PDF Download

 Page 1


Linked Lists
Page 2


Linked Lists
Representation & Basic 
Operations
What is a Linked 
List?
A sequence of data 
structures connected 
via links, making it the 
second most-used 
data structure after 
arrays.
Key Components
Each link stores data 
(element) and 
contains a connection 
(Next) to another link.
Structure
A Linked List contains the connection to the first link, 
called First, creating a chain of connected nodes.
Page 3


Linked Lists
Representation & Basic 
Operations
What is a Linked 
List?
A sequence of data 
structures connected 
via links, making it the 
second most-used 
data structure after 
arrays.
Key Components
Each link stores data 
(element) and 
contains a connection 
(Next) to another link.
Structure
A Linked List contains the connection to the first link, 
called First, creating a chain of connected nodes.
Linked List Representation
Linked lists can be visualized as a chain of nodes, where every node points to the next node. This 
creates a sequential access pattern that defines how we interact with the data structure.
As illustrated in the diagram, there are several important points to consider about linked lists:
The list contains a link element called first
Each link carries data field(s) and a link field called next
Each link connects to its next link using the next link
The last link carries a link as null to mark the end of the list
Page 4


Linked Lists
Representation & Basic 
Operations
What is a Linked 
List?
A sequence of data 
structures connected 
via links, making it the 
second most-used 
data structure after 
arrays.
Key Components
Each link stores data 
(element) and 
contains a connection 
(Next) to another link.
Structure
A Linked List contains the connection to the first link, 
called First, creating a chain of connected nodes.
Linked List Representation
Linked lists can be visualized as a chain of nodes, where every node points to the next node. This 
creates a sequential access pattern that defines how we interact with the data structure.
As illustrated in the diagram, there are several important points to consider about linked lists:
The list contains a link element called first
Each link carries data field(s) and a link field called next
Each link connects to its next link using the next link
The last link carries a link as null to mark the end of the list
Types of Linked Lists
Singly Linked List
Each node has data and 
a pointer to the next 
node, creating a one-
way traversal path.
Doubly Linked List
Contains pointers to 
both next and previous 
nodes, allowing 
bidirectional traversal.
Circular Linked List
The last element links 
back to the first 
element, forming a 
continuous loop 
structure.
Page 5


Linked Lists
Representation & Basic 
Operations
What is a Linked 
List?
A sequence of data 
structures connected 
via links, making it the 
second most-used 
data structure after 
arrays.
Key Components
Each link stores data 
(element) and 
contains a connection 
(Next) to another link.
Structure
A Linked List contains the connection to the first link, 
called First, creating a chain of connected nodes.
Linked List Representation
Linked lists can be visualized as a chain of nodes, where every node points to the next node. This 
creates a sequential access pattern that defines how we interact with the data structure.
As illustrated in the diagram, there are several important points to consider about linked lists:
The list contains a link element called first
Each link carries data field(s) and a link field called next
Each link connects to its next link using the next link
The last link carries a link as null to mark the end of the list
Types of Linked Lists
Singly Linked List
Each node has data and 
a pointer to the next 
node, creating a one-
way traversal path.
Doubly Linked List
Contains pointers to 
both next and previous 
nodes, allowing 
bidirectional traversal.
Circular Linked List
The last element links 
back to the first 
element, forming a 
continuous loop 
structure.
Singly Linked List
The singly linked list is the most common type of linked list. Each node 
contains two parts: data and a pointer to the next node in the sequence.
The structure is simple yet powerful, allowing for efficient insertions and 
deletions once you have a reference to the location. However, it only 
permits forward traversal through the list.
Node representation:
A three-member singly linked list: