MODULE-II

BCSE202L -
COURSE INSTRUCTOR: DATA STRUCTURES AND
DR. OM KUMAR C.U. ALGORITHMS
ASSISTANT PROFESSOR,
SCOPE,VIT.

DR. OM KUMAR C.U. 20/01/2025 1

 Overview of this Lecture
LINKED LIST
• Introduction to linked list

• Array versus linked list

• Linked lists in C

• Types of linked lists

• Single linked list

• Doubly linked list

• Circular linked list

DR. OM KUMAR C.U. 20/01/2025 2
 LINKED LIST
• A linked list is a data structure which allows to store data
dynamically and manage data efficiently.

• Typically, a linked list, in its simplest form looks like the

following
header

A B C NULL

DR. OM KUMAR C.U. 20/01/2025 3

 LINKED LIST
• Few salient features

• There is a pointer (called header) points the first element (also called node)

• Successive nodes are connected by pointers.

• Last element points to null.

• It can grow or shrink in size during execution of a program.

• It can be made just as long as required.

DR. OM KUMAR C.U. 20/01/2025 4

• It does not waste memory space, consume exactly what it needs.

 ARRAYS VERSUS LINKED LISTS

DR. OM KUMAR C.U. 20/01/2025 5

 Array: Contagious Storage
arrayName
0 10
1 15
2 20
3 22
4 25
5 30
6 35
7 40
8 45
9 50

DR. OM KUMAR C.U. 20/01/2025 6

 Array versus Linked Lists
 In arrays

 Elements are stored in a contagious memory locations

 Arrays are static data structure unless we use dynamic memory

allocation

 arrays are suitable for

 Inserting/deleting an element at the end.

 Randomly accessing any element.

 Searching the list for a particular value.

DR. OM KUMAR C.U. 20/01/2025 7
 Linked List: Non-Contagious Storage
h a i e c g

a
15 10 15 20 22 25 30
b f k b d
45
c
25 35 40 45 50
d
50
e
22 h
f 10 a 15 i 20 e 22 c 25 g 30 f

35
g
30
h 35 k 40 b 45 d 50
10
i
20 h
j
10 15 20 22 25 30
k
40
DR. OM KUMAR C.U.
35 40 45 50 20/01/2025 8
 Array versus Linked Lists
 In Linked lists

 Adjacency between any two elements are maintained by means of links

or pointers
 It is essentially a dynamic data structure

 Linked lists are suitable for

 Inserting an element at any position.

 Deleting an element from any where.

 Applications where sequential access is required.

 In situations, where the number of elements cannot be predicted

DR. OM KUMAR C.U. beforehand. 20/01/2025 9
 LINKED LISTS IN C

DR. OM KUMAR C.U. 20/01/2025 10

 DEFINING A NODE OF A LINKED LIST
Each structure of the list is called a node, and consists of two fields:
• Item (or) data
• Address of the next item in the list (or) pointer to the next node in the
list

How to define a node of a linked list?

struct node
node
{
int data; /* Data */ Data
struct node *next; /* pointer*/ next
} ;

Note:
Such structures which contain a member field pointing to the same structure type are
called self-referential structures.
DR. OM KUMAR C.U. 20/01/2025 11
 TYPES OF LISTS: SINGLE LINKED LIST
Depending on the way in which the links are used to maintain
adjacency, several different types of linked lists are possible.

Single linked list (or simply linked list)

• A head pointer addresses the first element of the list.
• Each element points at a successor element.
• The last element has a link value NULL.

head

A B C NULL

DR. OM KUMAR C.U. 20/01/2025 12

 TYPES OF LISTS: DOUBLE LINKED LIST

Double linked list

• Pointers exist between adjacent nodes in both directions.
• The list can be traversed either forward or backward.
• Usually,
headtwo pointers are maintained to keep track of the list,tailhead
and tail.
A B C

DR. OM KUMAR C.U. 20/01/2025 13

DEFINING A NODE OF A DOUBLE LINKED LIST
Each node of doubly linked list (DLL) consists of three fields:
• Item (or) Data
• Pointer of the next node in DLL
• Pointer of the previous node in DLL
node
Data
prev next

How to define a node of a doubly linked list (DLL)?

struct node
{
int data;
struct node *next; // Pointer to next node in DLL
struct node *prev; // Pointer to previous node in DLL
};

DR. OM KUMAR C.U. 20/01/2025 14

 DOUBLE LINKED LIST

• Doubly linked list is a collection of nodes linked together in a sequential way.

• Doubly linked list is almost similar to singly linked list except it contains two
address or reference fields, where one of the address field contains reference of
the next node and other contains reference of the previous node.
• First and last node of a linked list contains a terminator generally a NULL
value, that determines the start and end of the list.
• Doubly linked list is sometimes also referred as bi-directional linked list since it
allows traversal of nodes in both direction.
• Since doubly linked list allows the traversal of nodes in both direction, we can
keep track of both first and last nodes.

DR. OM KUMAR C.U. 20/01/2025 15

 DOUBLE VERSUS SINGLE LINKED LIST
Advantages over singly linked list
1) A DLL can be traversed in both forward and backward direction.
2) The delete operation in DLL is more efficient if pointer to the node to be deleted
is given.

Disadvantages over singly linked list

3) Every node of DLL Require extra space for an previous pointer.
4) All operations require an extra pointer previous to be maintained.

DR. OM KUMAR C.U. 20/01/2025 16

 TYPES OF LISTS: CIRCULAR LINKED LIST
head
A B C

Circular linked list

• The pointer from the last element in the list points
back to the first element.

DR. OM KUMAR C.U. 20/01/2025 17

 CIRCULAR LINKED LIST

• A circular linked list is basically a linear linked list that may be single- or double-
linked.

• The only difference is that there is no any NULL value terminating the list.

• In fact in the list every node points to the next node and last node points to the
first node, thus forming a circle. Since it forms a circle with no end to stop it is
called as circular linked list.

• In circular linked list there can be no starting or ending node, whole node can
be traversed from any node.

• In order to traverse the circular linked list, only once we need to traverse entire
list until the starting node is not traversed again.

• A circular linked list can be implemented using both singly linked list and
doubly
DR. linked list.
OM KUMAR C.U. 20/01/2025 18
 EXAMPLE 1: CREATING A SINGLE LINKED LIST
Linked list to store and print roll number, name and age of 3 students.

#include <stdio.h>
struct stud
{
int roll;
char name[30];
int age;
struct stud *next;
};
main()
{
struct stud n1, n2, n3;
struct stud *p;
scanf (“%d %s %d”, &n1.roll, n1.name, &n1.age);
scanf (“%d %s %d”, &n2.roll,n2.name, &n2.age);
scanf (“%d %s %d”, &n3.roll,n3.name, &n3.age);
DR. OM KUMAR C.U. 20/01/2025 19
 EXAMPLE 1: CREATING A SINGLE LINKED
LIST
n1.next = &n2 ;
n2.next = &n3 ;
n3.next = NULL ;
/* Now traverse the list and print the elements */
p = &n1 ; /* point to 1st element */
while (p != NULL)
{
printf (“\n %d %s %d”, p->roll, p->name, p->age);
p = p->next;
}
}

DR. OM KUMAR C.U. 20/01/2025 20

 EXAMPLE 1: ILLUSTRATION
The structure:

struct stud
{
int roll;
char name[30];
int age;
struct stud *next;
};

Also assume the list with three nodes n1, n2 and n3 for 3 students.

struct stud n1, n2, n3;

DR. OM KUMAR C.U. 20/01/2025 21

 EXAMPLE 1: ILLUSTRATION
To create the links between nodes, it is written as:

n1.next = &n2 ;
n2.next = &n3 ;
n3.next = NULL ; /* No more nodes follow */

• Now the list looks like:

rol
naml
eag
e
nex NULL
t n1 n2 n3

DR. OM KUMAR C.U. 20/01/2025 22

 EXAMPLE 2: CREATING A SINGLE LINKED LIST

C-program to store 10 values on a linked list reading the data from keyboard.

#include <stdio.h>
#include <stdlib.h>

struct node {
int data; //Data part
struct node *next; //Address part
}*header;

void createList(int n); /* Functions to create a list*/

int main()
{
int n;
printf("Enter the total number of nodes: ");
scanf("%d", &n);
DR. OM KUMAR C.U. createList(n); 20/01/2025 23
return 0;
}
 EXAMPLE 2: CREATING A SINGLE LINKED LIST
void createList(int n)
{
struct node *newNode, *temp;
int data, i;

/* A node is created by allocating memory to a structure */

newNode = (struct node *)malloc(sizeof(struct node));

/* If unable to allocate memory for head node */

if(newNode == NULL)
{
printf("Unable to allocate memory.");
}
else
{
printf("Enter the data of node 1: ");
scanf("%d", &data);

newNode->data = data; //Links the data field with data

newNode->next = NULL; //Links the address field to NULL
DR. OM KUMAR C.U. header = newNode; //Header points to the first node 20/01/2025 24

temp = newNode; //First node is the current node

 EXAMPLE 2: CREATING A SINGLE LINKED LIST

for(i=2; i<= n; i++)

{
/* A newNode is created by allocating memory */
newNode = (struct node *)malloc(sizeof(struct node));

if(newNode == NULL)
{
printf("Unable to allocate memory.");
break;
}
else
{
printf("Enter the data of node %d: ", i);
scanf("%d", &data);

newNode->data = data; //Links the data field of newNode with data

newNode->next = NULL; //Links the address field of newNode with NULL

temp->next = newNode; //Links previous node i.e. temp to the newNode

temp = temp->next;
}
DR. OM KUMAR C.U. } 20/01/2025 25
}
}
 Example 2: Illustration
• To start with, we have to create a node (the first node), and make header point to
it. newNode = (struct node *)malloc(sizeof(struct
node));
newNode->data = data; //Links the data field
with data
newNode->next = NULL; //Links the address field
to NULL
header = newNode;
temp = newNode;

header
100 NULL

It creates a single node. For example, if the data entered is 100 then the list
look like
DR. OM KUMAR C.U. 20/01/2025 26
 Creating a single linked list
If we need n number of nodes in the linked list:
• Allocate n newNodes, one by one.
• Read in the data for the newNodes.
• Modify the links of the newNodes so that the chain is formed.

newNode = (struct node *)malloc(sizeof(struct node));

newNode->data = data; //Links the data field of newNode with data
newNode->next = NULL; //Links the address field of newNode with NULL

temp->next = newNode; //Links previous node i.e. temp to the newNode

temp = temp->next;

It creates n number of nodes . For e.g. if the data entered is 200, 50, 30 then
the list look like
hea
d 10 20 50 30 NULL
0 0
DR. OM KUMAR C.U. 20/01/2025 27
 EXAMPLE 3: CREATING A SINGLE LINKED LIST
C-program to copy an array to a single linked list.

#include <stdio.h>
#include <stdlib.h>

struct node {
int data; //Data part
struct node *next; //Address part
};

int main()
{
struct node *header, *newNode, *temp;
int data, i, n, a[100];
printf("Enter the total number of data: ");
scanf("%d", &n);
// Write code here to initialize the array a with n
elements //
DR. OM KUMAR C.U. 20/01/2025 28

...
 EXAMPLE 2: CREATING A SINGLE LINKED LIST

/* A node is created by allocating memory to a structure */

newNode = (struct node *)malloc(sizeof(struct node));

/* If unable to allocate memory for head node */

if(newNode == NULL)
{
printf("Unable to allocate memory.");
}
else
{
newNode->data = a[0]; //Links the data field with data
newNode->next = NULL; //Links the address field to NULL
header = newNode; //Header points to the first node
temp = header;

DR. OM KUMAR C.U. 20/01/2025 29

 EXAMPLE 2: CREATING A SINGLE LINKED LIST
for(i = 1; i <= n; i++)
{
/* A newNode is created by allocating memory */
newNode = (struct node *)malloc(sizeof(struct node));

if(newNode == NULL)
{
printf("Unable to allocate memory.");
break;
}
else
{
newNode->data = a[i]; //Links the data field of newNode with a[i]
newNode->next = NULL; //Links the address field of newNode with
NULL

temp->next = newNode; //Links previous node i.e. temp to the

newNode
temp = temp->next;
}
}
DR. OM KUMAR C.U. 20/01/2025 30

}
}
 OPERATIONS ON LINKED LISTS

DR. OM KUMAR C.U. 20/01/2025 31

 OPERATIONS ON SINGLE LINKED LIST
• Traversing a list
• Printing, finding minimum, etc.

• Insertion of a node into a list

• At front, end and anywhere, etc.

• Deletion of a node from a list

• At front, end and anywhere, etc.

• Comparing two linked lists

• Similarity, intersection, etc.
• Merging two linked lists into a larger list
• Union, concatenation, etc.
• Ordering a list
• Reversing, sorting, etc.
DR. OM KUMAR C.U. 20/01/2025 32
 TRAVERSING A LINKED LIST

DR. OM KUMAR C.U. 20/01/2025 33

 SINGLE LINKED LIST: TRAVERSING

Once the linked list has been constructed and header points to the first node of the
list,
• Follow the pointers.
• Display the contents of the nodes as they are traversed.
• Stop when the next pointer points to null.

The function traverseList(struct Node *) is given in the next

slide. This function to be called from main() function as:
int main()
{
// Assume header, the pointer to the linked list is given as an input
printf("\n Data in the list \n");
traverseList(header);
return 0;
}
DR. OM KUMAR C.U. 20/01/2025 34
 SINGLE LINKED LIST: TRAVERSING

void traverseList(struct Node *header)

{
struct node *temp;

/* If the list is empty i.e. head = NULL */

if(header == NULL)
{
printf("List is empty.");
}
else
{
temp = header;
while(temp != NULL)
{
printf("Data = %d\n", temp->data); //Prints the data of current node
temp = temp->next; //Advances the position of current node
}
}
}
DR. OM KUMAR C.U. 20/01/2025 35
 INSERTION IN A LINKED LIST

DR. OM KUMAR C.U. 20/01/2025 36

 SINGLE LINKED LIST: INSERTION

Insertion steps:
• Create a new node
• Start from the header node
• Manage links to
• Insert at front
• Insert at end
• Insert at any position
DR. OM KUMAR C.U. 20/01/2025 37
 INSERTION AT FRONT

Steps to insert node at the beginning of singly linked list

Step 1: Create a new node.

DR. OM KUMAR C.U. 20/01/2025 38

 INSERTION AT FRONT
Step 2: Link the newly created node with the head node, i.e. the newNode will now
point to head node.

Step 3: Make the new node as the head node, i.e. now head node will point to newNode.

DR. OM KUMAR C.U. 20/01/2025 39

 INSERTION AT FRONT

/*Create a new node and insert at the beginning of the linked list.*/

void insertNodeAtBeginning(int data)

{
struct node *newNode;
newNode = (struct node*)malloc(sizeof(struct node));

if(newNode == NULL)
{
printf("Unable to allocate memory.");
}
else
{
newNode->data = data; //Links the data part
newNode->next = head; //Links the address part

head = newNode; //Makes newNode as first node

printf("DATA INSERTED SUCCESSFULLY\n");

}
}
DR. OM KUMAR C.U. 20/01/2025 40
 SINGLE
Steps toLINKED LIST:atINSERTION
insert node the end of AT ENDlinked list
Singly
Step 1: Create a new node and make sure that the address part of the new node points to
NULL. i.e. newNode->next=NULL

Step 2: Traverse to the last node of the linked list and connect the last node of the list with
the new node, i.e. last node will now point to new node. (lastNode->next =
newNode).

DR. OM KUMAR C.U. 20/01/2025 41

 INSERTION AT END

/* Create a new node and insert at the end of the linked list. */
void insertNodeAtEnd(int data)
{
struct node *newNode, *temp;
newNode = (struct node*)malloc(sizeof(struct node));
if(newNode == NULL)
{
printf("Unable to allocate memory.");
}
else
{
newNode->data = data; //Links the data part
newNode->next = NULL;
temp = head;

while(temp->next != NULL) //Traverse to the last node

temp = temp->next;

temp->next = newNode; //Links the address part

printf("DATA INSERTED SUCCESSFULLY\n");
}
}
DR. OM KUMAR C.U. 20/01/2025 42
 Single Linked List: Insertion at any Position
Steps to insert node at any position of Singly Linked List
Step 1: Create a new node.

Step 2: Traverse to the n-1th position of the linked list and connect the new node with the
n+1th node. (newNode->next = temp->next) where temp is the n-1th node.

DR. OM KUMAR C.U. 20/01/2025 43

 SINGLE LINKED LIST: INSERTION AT ANY POSITION

Step 3: Now at last connect the n-1th node with the new node i.e. the n-1th node will now
point to new node. (temp->next = newNode) where temp is the n-1th node.

DR. OM KUMAR C.U. 20/01/2025 44

 INSERTION AT ANY POSITION

/* Create a new node and insert at middle of the linked list.*/

void insertNodeAtMiddle(int data, int position)

{
int i;
struct node *newNode, *temp;

newNode = (struct node*)malloc(sizeof(struct node));

if(newNode == NULL)
{
printf("Unable to allocate memory.");
}
else
{
newNode->data = data; //Links the data part
newNode->next = NULL;

temp = head;

DR. OM KUMAR C.U. 20/01/2025 45

 INSERTION AT ANY POSITION
for(i=2; i<=position-1; i++) /* Traverse to the n-1 position */
{
temp = temp->next;

if(temp == NULL)
break;
}
if(temp != NULL)
{
/* Links the address part of new node */
newNode->next = temp->next;

/* Links the address part of n-1 node */

temp->next = newNode;

printf("DATA INSERTED SUCCESSFULLY\n");

}
else
{
printf("UNABLE TO INSERT DATA AT THE GIVEN POSITION\n");
}
}
}
DR. OM KUMAR C.U. 20/01/2025 46
 Single linked list: Deletion at End
Steps to delete last node of a Singly Linked List
Step 1: Traverse to the last node of the linked list keeping track of the second last node in
some temp variable say secondLastNode.

Step 2: If the last node is the head node then make the head node as NULL else disconnect
the second last node with the last node i.e. secondLastNode->next = NULL

DR. OM KUMAR C.U. 20/01/2025 47

 Single linked list: Deletion at End

Step 3: Free the memory occupied by the last node.

DR. OM KUMAR C.U. 20/01/2025 48

 DELETION AT END
/* Delete the last node of the linked list */
void deleteLastNode()
{
struct node *toDelete, *secondLastNode;
toDelete = head;
secondLastNode = head;

while(toDelete->next != NULL) /* Traverse to the last node of the list*/

{
secondLastNode = toDelete;
toDelete = toDelete->next;
}
if(toDelete == head)
{
head = NULL;
}
else
{
/* Disconnects the link of second last node with last node */
secondLastNode->next = NULL;
}
/* Delete the last node */
free(toDelete);
}
DR. OM KUMAR C.U. 20/01/2025 49
 Single Linked List: Deletion at any Position
Steps to delete a node at any position of Singly Linked List
Step 1: Traverse to the nth node of the singly linked list and also keep reference of n-1 th node
in some temp variable say prevNode.

Step 2: Reconnect n-1th node with the n+1th node i.e. prevNode->next = toDelete->next
(Where prevNode is n-1th node and toDelete node is the nth node and toDelete->next is the n+1th
node).

DR. OM KUMAR C.U. 20/01/2025 50

 SINGLE LINKED LIST: DELETION AT ANY POSITION

Step 3: Free the memory occupied by the nth node i.e. toDelete node.

DR. OM KUMAR C.U. 20/01/2025 51

 DELETION AT ANY POSITION

/* Delete the node at any given position of the linked list */

void deleteMiddleNode(int position)
{
int i;
struct node *toDelete, *prevNode;
if(head == NULL)
{
printf("List is already empty.");
}
else
{
toDelete = head;
prevNode = head;

for(i=2; i<=position; i++)

{
prevNode = toDelete;
toDelete = toDelete->next;

if(toDelete == NULL)
break;
}

DR. OM KUMAR C.U. 20/01/2025 52

 DELETION AT ANY POSITION

if(toDelete != NULL)
{
if(toDelete == head)
head = head->next;

prevNode->next = toDelete->next;
toDelete->next = NULL;

/* Deletes the n node */

free(toDelete);

printf("SUCCESSFULLY DELETED NODE FROM MIDDLE OF LIST\n");

}
else
{
printf("Invalid position unable to delete.");
}
}
}

DR. OM KUMAR C.U. 20/01/2025 53

CIRCULAR LINKED LIST

DR. OM KUMAR C.U. 20/01/2025 54

 TYPES OF LISTS: CIRCULAR LINKED LIST

Circular linked list

• The pointer from the last element in the list points back to the first
element. head

A B C

DR. OM KUMAR C.U. 20/01/2025 55

 CIRCULAR LINKED LIST
• A circular linked list is basically a linear linked list that may be single- or
double-linked.

• The only difference is that there is no any NULL value terminating the list.

• In fact in the list every node points to the next node and last node points to the
first node, thus forming a circle. Since it forms a circle with no end to stop it is
called as circular linked list.

• In circular linked list there can be no starting or ending node, whole node can
be traversed from any node.

• In order to traverse the circular linked list, only once we need to traverse
entire list until the starting node is not traversed again.

• A circular linked list can be implemented using both singly linked list and
DR. OM KUMAR C.U. 20/01/2025 56

doubly linked list.

 CIRCULAR LINKED LIST:

Basic structure of singly circular linked list:

Doubly circular linked list:

DR. OM KUMAR C.U. 20/01/2025 57

 CIRCULAR LINKED LIST:

Advantages of a Circular linked list

• Entire list can be traversed from any node.
• Circular lists are the required data structure when we want a list to be accessed in a
circle or loop.
• Despite of being singly circular linked list we can easily traverse to its previous
node, which is not possible in singly linked list.

Disadvantages of Circular linked list

• Circular list are complex as compared to singly linked lists.
• Reversing of circular list is a complex as compared to singly or doubly lists.
• If not traversed carefully, then we could end up in an infinite loop.
• Like singly and doubly lists circular linked lists also doesn’t supports direct
DR. OM KUMAR C.U. 20/01/2025 58

accessing of elements.
 OPERATIONS ON CIRCULAR LINKED LIST

• Creation of list
• Traversal of list
• Insertion of node
• At the beginning of list
• At any position in the list
• Deletion of node
• Deletion of first node
• Deletion of node from middle of the list
• Deletion of last node
• Counting total number of nodes
DR. OM KUMAR C.U. 20/01/2025 59

• Reversing of list
DR. OM KUMAR C.U. 20/01/2025 60
 CREATION AND TRAVERSAL OF A CIRCULAR LIST
#include <stdio.h>
#include <stdlib.h>

/* Basic structure of Node */

struct node {
int data;
struct node * next;
}*head;

int main()
{
int n, data;
head = NULL;

printf("Enter the total number of nodes in list: ");

scanf("%d", &n);
createList(n); // function to create circular linked list
displayList(); // function to display the list
DR. OM KUMAR C.U. 20/01/2025 61
return 0;
}
 CIRCULAR LINKED LIST: CREATION OF LIST
void createList(int n)
{
int i, data;
struct node *prevNode, *newNode;
if(n >= 1){ /* Creates and links the head node */
head = (struct node *)malloc(sizeof(struct node));

printf("Enter data of 1 node: ");

scanf("%d", &data);

head->data = data;
head->next = NULL;
prevNode = head;

for(i=2; i<=n; i++){ /* Creates and links rest of the n-1 nodes */
newNode = (struct node *)malloc(sizeof(struct node));

printf("Enter data of %d node: ", i);

scanf("%d", &data);

newNode->data = data;
newNode->next = NULL;
prevNode->next = newNode; //Links the previous node with newly created node
prevNode = newNode; //Moves the previous node ahead
DR. OM KUMAR C.U. 20/01/2025 62
}
prevNode->next = head; //Links the last node with first node
printf("\nCIRCULAR LINKED LIST CREATED SUCCESSFULLY\n"); }}
 CIRCULAR LINKED LIST: TRAVERSAL OF LIST
void displayList()
{
struct node *current;
int n = 1;

if(head == NULL)
{
printf("List is empty.\n");
}
else
{
current = head;
printf("DATA IN THE LIST:\n");

do {
printf("Data %d = %d\n", n, current->data);

current = current->next;
n++;
DR. OM KUMAR C.U.
}while(current != head); 20/01/2025 63
}
}
Insertion
A node can be added in three ways:
•Insertion in an empty list struct Node *addToEmpty(struct Node *last,
•Insertion at the end of the list int data)
•Insertion in between the nodes { // This function is only for empty list
if (last != NULL)
return last;
Insertion in an empty List // Creating a node dynamically.
Initially when the list is empty, last pointer will be struct Node *last =
(struct Node*)malloc(sizeof(struct
NULL.
Node));
// Assigning the data.
•Insertion at the beginning of the list last -> data = data;
// Note : list was empty. We link single
node
// to itself.
last -> next = last;
return last; }

DR. OM KUMAR C.U. 20/01/2025 64

 INSERTION AT THE BEGINNING OF THE LIST

To Insert a node at the beginning

of the list, follow these step:
struct Node *addBegin(struct Node *last, int
1. Create a node, say T. data)
{
2. Make T -> next = last -> next. if (last == NULL)
return addToEmpty(last, data);
3. last -> next = T // Creating a node dynamically.
struct Node *temp
= (struct Node *)malloc(sizeof(struct
Node));
// Assigning the data.
temp -> data = data;
// Adjusting the links.
temp -> next = last -> next;
last -> next = temp;
return last; }

DR. OM KUMAR C.U. 20/01/2025 65

After insertion,
 Insertion at the end of the list

struct Node *addEnd(struct Node *last, int data)

{
if (last == NULL)
return addToEmpty(last, data);

// Creating a node dynamically.

struct Node *temp =
To Insert a node at the end of the (struct Node *)malloc(sizeof(struct Node));

list, follow these step: // Assigning the data.

temp -> data = data;
1. Create a node, say T.
2. Make T -> next = last -> next; // Adjusting the links.
temp -> next = last -> next;
3. last -> next = T. last -> next = temp;
last = temp;
4. last = T. return last;
}

DR. OM KUMAR C.U. 20/01/2025 66

 To insert a node at the end of the list, follow these
step: INSERTION IN BETWEEN THE NODES
1. Create a node, say T.
2. Search the node after which T need to be insert,
say that node be P.
3. Make T -> next = P -> next;
struct Node *addAfter(struct Node *last, int data, int
4. P -> next = T. item)
{ if (last == NULL)
 Suppose 12 need to be insert after node having return NULL;
struct Node *temp, *p;
value 10, p = last -> next;
// Searching the item.
do {
if (p ->data == item)
{ // Creating a node dynamically.
temp = (struct Node *)malloc(sizeof(struct
Node));
// Assigning the data.
temp -> data = data;
// Adjusting the links.
temp -> next = p -> next;
// Adding newly allocated node after p.
p -> next = temp;
// Checking for the last node.
if (p == last)
last = temp;
return last; }
p = p -> next;
} while (p != last -> next);
cout << item << " not present in the list." << endl;
return last; }
DR. OM KUMAR C.U. 20/01/2025 67
DOUBLY LINKED LIST

DR. OM KUMAR C.U. 20/01/2025 68

 DEFINING A NODE OF A LINKED LIST

Each structure of the list is called a node, and consists of two

fields:
• Item (or) data
• Address of the next item in the list (or) pointer to the next
node in the listHow to define a node of a linked list?
struct node node
{ Data
int data; /* Data next
*/
struct node *next; /*
pointer*/
} ;
Note:
Such structures which contain a member field pointing to the same structure type are
DR. OM KUMAR C.U. called self-referential structures. 20/01/2025 69
 DEFINING A NODE OF A DOUBLE LINKED LIST
Each node of doubly linked list (DLL) consists of three fields:
• Item (or) Data
• Pointer of the next node in DLL
• Pointer of the previous node in DLL
node
Data
prev next

How to define a node of a doubly linked list (DLL)?

struct node
{
int data;
struct node *next; // Pointer to
next node in DLL
struct node *prev; // Pointer to
previous node in DLL
DR. OM KUMAR C.U. 20/01/2025 70
};
 DOUBLE LINKED LIST
• Doubly linked list is a collection of nodes linked together in a sequential way.

• Doubly linked list is almost similar to singly linked list except it contains two address or
reference fields, where one of the address field contains reference of the next node and other
contains reference of the previous node.

• First and last node of a linked list contains a terminator generally a NULL value, that determines
the start and end of the list.

• Doubly linked list is sometimes also referred as bi-directional linked list since it allows traversal
of nodes in both direction.

• Since doubly linked list allows the traversal of nodes in both direction, we can keep track of both
first and last nodes.

DR. OM KUMAR C.U. 20/01/2025 71

 DOUBLE VERSUS SINGLE LINKED LIST
Advantages over singly linked list

1)A DLL can be traversed in both forward and backward direction.

2)The delete operation in DLL is more efficient if pointer to the node to be
deleted is given.

Disadvantages over singly linked list

3)Every node of DLL Require extra space for an previous pointer.
4)All operations require an extra pointer previous to be maintained.

DR. OM KUMAR C.U. 20/01/2025 72

 DOUBLE LINKED LIST: INSERTION AT ANY POSITION

Steps to insert a new node at nth position in a Doubly linked list.

Step 1: Traverse to N-1 node in the list, where N is the position to insert. Say
temp now points to N-1th node.

Step 2: Create a newNode that is to be inserted

and assign some data to its data field.

DR. OM KUMAR C.U. 20/01/2025 73

 DOUBLY LINKED LIST: INSERTION AT ANY
POSITION

Step 3: Connect the next address field of newNode with the node
pointed by next address field of temp node.

Step 4: Connect the previous address field of newNode with the

temp node.

DR. OM KUMAR C.U. 20/01/2025 74

 DOUBLY LINKED LIST: INSERTION AT ANY POSITION

Step 5: Check if temp.next is not NULL then, connect the previous address
field of node pointed by temp.next to newNode.

Step 6: Connect the next address field of temp node to newNode.

DR. OM KUMAR C.U. 20/01/2025 75

 DOUBLY LINKED LIST: INSERTION AT ANY POSITION

Step 7: Final doubly linked list looks like

DR. OM KUMAR C.U. 20/01/2025 76

 DOUBLY LINKED LIST: INSERTION AT ANY POSITION
#include <stdio.h>
#include <stdlib.h>

struct node { /* Basic structure of Node */

int data;
struct node * prev;
struct node * next;
}*head, *last;

int main()
{
int n, data;
head = NULL;
last = NULL;

printf("Enter the total number of nodes in list: ");

scanf("%d", &n);
createList(n); // function to create double linked list
displayList(); // function to display the list

printf("Enter the position and data to insert new node: ");

scanf("%d %d", &n, &data);
insert_position(data,
DR. OM KUMAR C.U. n); // function to insert node at any position 20/01/2025 77

displayList();
return 0;}
 DOUBLY LINKED LIST: INSERTION AT ANY POSITION
void createList(int n)
{
int i, data;
struct node *newNode;
if(n >= 1){ /* Creates and links the head node */
head = (struct node *)malloc(sizeof(struct node));
printf("Enter data of 1 node: ");
scanf("%d", &data);
head->data = data;
head->prev = NULL;
head->next = NULL;
last = head;
for(i=2; i<=n; i++){ /* Creates and links rest of the n-1 nodes */
newNode = (struct node *)malloc(sizeof(struct node));
printf("Enter data of %d node: ", i);
scanf("%d", &data);
newNode->data = data;
newNode->prev = last; //Links new node with the previous node
newNode->next = NULL;

last->next = newNode; //Links previous node with the new node

last = newNode; //Makes new node as last/previous node
}
DR. OM KUMAR C.U. 20/01/2025 78
printf("\nDOUBLY LINKED LIST CREATED SUCCESSFULLY\n"); }}
 DOUBLY LINKED LIST: INSERTION AT ANY POSITION
void insert_position(int data, int position)
{
struct node * newNode, *temp;
if(head == NULL){
printf("Error, List is empty!\n");
}
else{
temp = head;
if(temp!=NULL){
newNode = (struct node *)malloc(sizeof(struct node));

newNode->data = data;
newNode->next = temp->next; //Connects new node with n+1th node
newNode->prev = temp; //Connects new node with n-1th node

if(temp->next != NULL)
{
temp->next->prev = newNode; /* Connects n+1th node with new node */
}
temp->next = newNode; /* Connects n-1th node with new node */
printf("NODE INSERTED SUCCESSFULLY AT %d POSITION\n", position);
}
DR. OM KUMAR C.U. else{ 20/01/2025 79

printf("Error, Invalid position\n"); }

}}
 DOUBLY LINKED LIST: INSERTION AT ANY POSITION

void displayList()
{
struct node * temp;
int n = 1;

if(head == NULL)
{
printf("List is empty.\n");
}
else
{
temp = head;
printf("DATA IN THE LIST:\n");

while(temp != NULL)
{
printf("DATA of %d node = %d\n", n, temp->data);
n++;

/* Moves the current pointer to next node */

temp = temp->next;
DR. OM KUMAR C.U. } 20/01/2025 80
}
}
 COMPARING TWO LINKED LISTS

DR. OM KUMAR C.U. 20/01/2025 81

 SINGLE LINKED LIST: COMPARING TWO LISTS

Comparing two linked list includes

• Identifying whether the given two linked list are identical.

• Two Linked Lists are identical when they have same data and
arrangement of data is also same.

• Checking whether the lists have same values when the

arrangement is not same.

DR. OM KUMAR C.U. 20/01/2025 82

 COMPARING TWO LINKED LISTS
/* Return true if linked lists a and b are identical, otherwise false */
bool areIdentical(struct node *a, struct node *b)
{
while (a != NULL && b != NULL)
{
if (a->data != b->data)
return false;
/* If we reach here, then a and b are not NULL and their data is same, so move
to next nodes in both lists */
a = a->next;
b = b->next;
}
//If linked lists are identical, then 'a' and 'b' must be NULL at this point.
return (a == NULL && b == NULL);
}

int main()
{
struct node *a, *b;
a = createList(5); // e.g: a: 5->4->3->2->1
b = createList(5); // e.g: b: 5->4->3->2->1
areIdentical(a, b)? printf("Identical"): printf("Not identical");
return
DR. OM KUMAR C.U. 0; 20/01/2025 83
}
 FEW EXERCISES TO TRY OUT

Write a function to:

• Concatenate or merge two given list into one big list.

node *concatenate(node *a, node *b);

• Compare two given list with same data but different arrangement.
e.g: a: 5->4->3->2->1
b: 1->2->3->4->5

• Count the number of nodes in the given list using iterative method and
recursive method.
DR. OM KUMAR C.U. 20/01/2025 84
 ORDERING LINKED LIST

DR. OM KUMAR C.U. 20/01/2025 85

 SINGLE LINKED LIST: REVERSING
Reversing a list can be performed in two ways:
• Iterative method
• Recursive method

Steps to reverse a Singly Linked List using Iterative method

Step 1: Create two more pointers other than head namely prevNode and curNode that
will hold the reference of previous node and current node respectively.
• Make sure that prevNode points to first node i.e. prevNode = head.
• head should now point to its next node i.e. head = head->next.
• curNode should also points to the second node i.e. curNode = head.
DR. OM KUMAR C.U. 20/01/2025 86
 REVERSING A LIST
Step 2: Now, disconnect the first node from others. We will make sure
that it points to none. As this node is going to be our last node.
Perform operation prevNode->next = NULL.

Step 3: Move the head node to its next node i.e. head = head->next.

DR. OM KUMAR C.U. 20/01/2025 87

 REVERSING A LIST
Step 4: Now, re-connect the current node to its previous node
i.e. curNode->next = prevNode;

Step 5: Point the previous node to current node and current node to head
node. Means they should now point to prevNode = curNode; and
curNode = head.

DR. OM KUMAR C.U. 20/01/2025 88

 REVERSING A LIST
Step 6: Repeat steps 3-5 till head pointer becomes NULL.

Step 7: Now, after all nodes has been re-connected in the reverse order. Make the
last node as the first node. Means the head pointer should point to prevNode
pointer.
• Perform head = prevNode; And finally you end up with a reversed linked
list of its original.

DR. OM KUMAR C.U. 20/01/2025 89

 REVERSING A LIST: ITERATIVE METHOD
void reverseList()
{
struct node *prevNode, *curNode;
if(head != NULL)
{
prevNode = head;
curNode = head->next;
head = head->next;

prevNode->next = NULL; //Makes the first node as last node

while(head != NULL)
{
head = head->next;
curNode->next = prevNode;

prevNode = curNode;
curNode = head;
}

head = prevNode; //Makes the last node as head

printf("SUCCESSFULLY REVERSED LIST\n");
}
DR. OM KUMAR C.U. 20/01/2025 90
}
 REVERSING A LIST: RECURSIVE METHOD

/* Function to reverse the linked list */

void Recursive_Reverse(struct node* head)
{
if (head == NULL) // boundary condition to stop recursion
return;

Recursive_Reverse(head->next); // print the list after head node

printf("%d ", head->data); // After everything else is printed, print head

}

/* It should be called from the main() function as */

int main()
{
int n = 10;
createList(n); // creates 10 nodes in the linked list
Recursive_Reverse(head);

return 0;
}
DR. OM KUMAR C.U. 20/01/2025 91
 THANK YOU

DR. OM KUMAR C.U. 20/01/2025 92