Introduction to Linked Lists and its types. From AISSMS IOIT

1. LINKED LIST
PREPARED BY:
KESHAV V
SHREYAS S
UNDER THE GUIDANCE OF:
MRS. N.S.PATIL
SE COMP, AISSMS' IOIT, PUNE

2. INTRODUCTION TO LINKED
LIST
A linked list is a series of connected nodes, where each node is a data structure.
Linked list can grow as well as shrink in size during execution.
Each node in a linked list contains one or more members that represent data.
In addition to the data, each node contains a pointer, which can point to another
node.
A linked list is called “linked” because each node in the series has a pointer that
points to the next node in the list.

3. REAL LIFE EXAMPLE
A linked list is like a scavenger hunt. You have a
clue, and that clue has a pointer to the place
having the next clue. So you go to the next place
and get another piece of data and another pointer.
To get something in the middle or at the end, the
only way is to follow the list from the beginning.

4. ADVANTAGES OF LINKED
LISTS OVER ARRAYS AND
VECTORS
A linked list can easily grow or shrink in size.
Insertion and deletion of nodes is quicker with
linked list than with vectors.

5. DECLARATIONS
First you must declare a data structure that will be used for the nodes.
For example, the following struct could be used to create a list where each node
holds a float:
struct node
{
float data;
struct node *next;
}

6. DECLARATIONS
The next step is to declare a pointer to serve as the list head,
as shown below:
node *head;
Once you have declared a node data structure and created a
null head pointer, you have an empty linked list.
The next step is to implement the operations with the list.

7. OPERATIONS ON LINKED
LISTS
The following operations can be performed on a linked list:
1. Inserting a new node at the beginning of the linked list.
2. Inserting a new node at the end of the linked list.
3. Inserting a new node at the middle of the linked list.
4. Deleting the first node from the linked list.
5. Deleting the last node from the linked list.
6. Deleting any middle node from the linked list.
7. Searching a node in the linked list.
8. Sorting a linked list.
9. Merging two linked lists.
10. Displaying a linked list.

8. TYPES OF LINKED LISTS
The following are the types of linked lists:
1. Singly Linked List.
2. Doubly Linked List.
3. Circular singly linked list.
4. Circular doubly linked list.

9. SINGLY LINKED LIST
A singly linked list is the one in which each node contains the
address of its successor node.
As each node has only one link part, back traversal of the list
is not feasible.
Link part of the last node contains NULL value, which
signifies the end of the list.
10 30 NULL20

10. DOUBLY LINKED LIST
A doubly linked list is the one in which each node contains the
address of its successor node as well as its predecessor
node.
As each node has two link parts, back traversal becomes
quite easy.
“next” link of the last node and “previous” link of the first node
contain NULL value.
NULL 10 30 NULL20

11. CIRCULAR SINGLY LINKED
LIST
In this type of linked list, each node contains the address of
its successor node, same as in singly linked list.
But the difference is that in circular singly linked list, the last
node does not contain NULL value. Instead, it contains the
address of the head node.
Due to this, once we arrive at the last node, we are able to
access the first node of the list easily.
10 3020

12. CIRCULAR DOUBLY
LINKED LIST
In this linked list, each node contains two address fields, one
which contains the address of its next node and the other
which contains the address of its previous node, just like in
doubly linked list.
But here, the “previous” link of the head node and the “next”
link of the last node do not contain NULL value. Instead, the
last node points to the head node and the head node points
back to the last node.
So, traversal in both the directions is easily possible.
10 3020

13. THE END
THANK YOU!