Outline…

*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

Linked List R Patil 1 10/4/2023

 Introduction to Linked Lists

Linked List R Patil 2 10/4/2023

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

Linked List R Patil 3 10/4/2023

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.
• It does not waste memory space, consume exactly what it needs.

Linked List R Patil 4 10/4/2023

 Arrays versus Linked Lists

Linked List R Patil 5 10/4/2023

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

Linked List R Patil 6 10/4/2023

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.

Linked List R Patil 7 10/4/2023

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
35 40 45 50
Linked List R Patil 8 10/4/2023
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 beforehand.

Linked List R Patil 9 10/4/2023

 Linked Lists in C

Linked List R Patil 10 10/4/2023

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.

Linked List R Patil 11 10/4/2023

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

Linked List R Patil 12 10/4/2023

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 two pointers are maintained to keep track of the list, head and
tail.

head tail

A B C

Linked List R Patil 13 10/4/2023

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
};

Linked List R Patil 14 10/4/2023

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.

Linked List R Patil 15 10/4/2023

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

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

Linked List R Patil 16 10/4/2023

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

Linked List R Patil 17 10/4/2023

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 linked list.

Linked List R Patil 18 10/4/2023

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);

Linked List R Patil 19 10/4/2023

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;
}
}

Linked List R Patil 20 10/4/2023

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;

Linked List R Patil 21 10/4/2023

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:

roll
name
age
next NULL
n1 n2 n3

Linked List R Patil 22 10/4/2023

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);
createList(n);
return 0;
}

Linked List R Patil 23 10/4/2023

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
header = newNode; //Header points to the first node
temp = newNode; //First node is the current node

Linked List R Patil 24 10/4/2023

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;
}
}
}
}

Linked List R Patil 25 10/4/2023

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;

It creates a single node. For example, if the data entered is 100 then the list look
like
header
100 NULL

Linked List R Patil 26 10/4/2023

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

head
100 200 50 30 NULL

Linked List R Patil 27 10/4/2023

 Operations on Linked Lists

Linked List R Patil 28 10/4/2023

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.
Linked List R Patil 29 10/4/2023
 Traversing a Linked List

Linked List R Patil 30 10/4/2023

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;
}
Linked List R Patil 31 10/4/2023
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
}
}
}

Linked List R Patil 32 10/4/2023

 Insertion in a Linked List

Linked List R Patil 33 10/4/2023

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

Linked List R Patil 34 10/4/2023

Insertion at Front
Steps to insert node at the beginning of singly linked list

Step 1: Create a new node.

Linked List R Patil 35 10/4/2023

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.

Linked List R Patil 36 10/4/2023

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");

}
}

Linked List R Patil 37 10/4/2023

Single Linked List: Insertion at End
Steps to insert node at the end of Singly linked list
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).

Linked List R Patil 38 10/4/2023

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");
}
}

Linked List R Patil 39 10/4/2023

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.

Linked List R Patil 40 10/4/2023

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.

Linked List R Patil 41 10/4/2023

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;

Linked List R Patil 42 10/4/2023

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");
}
}
}

Linked List R Patil 43 10/4/2023

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.

Linked List R Patil 44 10/4/2023

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.

Linked List R Patil 45 10/4/2023

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.

Linked List R Patil 46 10/4/2023

Doubly Linked List: Insertion at any Position
Step 7: Final doubly linked list looks like

Linked List R Patil 47 10/4/2023

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, n); // function to insert node at any position
displayList();
return 0;
}

Linked List R Patil 48 10/4/2023

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
}
printf("\nDOUBLY LINKED LIST CREATED SUCCESSFULLY\n");
}
}

Linked List R Patil 49 10/4/2023

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);
}
else{
printf("Error, Invalid position\n");
}
}
}

Linked List R Patil 50 10/4/2023

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;
}
}
}

Linked List R Patil 51 10/4/2023

 Deletion from a Linked List

Linked List R Patil 52 10/4/2023

Single Linked List: Deletion

Deletion steps
• Start from the header node
• Manage links to
• Delete at front
• Delete at end
• Delete at any position
• freeingup the node as free space.

Linked List R Patil 53 10/4/2023

Free Memory after Deletion

• Do not forget to free() memory location dynamically allocated

for a node after deletion of that node.

• It is the programmer’s responsibility to free that memory

block.

• Failure to do so may create a dangling pointer – a memory,

that is not used either by the programmer or by the system.

• The content of a free memory is not erased until it is

overwritten.

Linked List R Patil 54 10/4/2023

Single Linked List: Deletion at Front
Steps to delete first node of Singly Linked List
Step 1: Copy the address of first node i.e. head node to some temp variable say toDelete.

Step 2: Move the head to the second node of the linked list (head = head->next).

Linked List R Patil 55 10/4/2023

Single linked list: Deletion at front
Step 3: Disconnect the connection of first node to second node.

Step 4: Free the memory occupied by the first node.

Linked List R Patil 56 10/4/2023

Deletion at Front
/* Delete the first node of the linked list */
void deleteFirstNode()
{
struct node *toDelete;

if(head == NULL)
{
printf("List is already empty.");
}
else
{
toDelete = head;
head = head->next;

printf("\nData deleted = %d\n", toDelete->data);

/* Clears the memory occupied by first node*/

free(toDelete);

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

}
}

Linked List R Patil 57 10/4/2023

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

Linked List R Patil 58 10/4/2023

Single linked list: Deletion at End
Step 3: Free the memory occupied by the last node.

Linked List R Patil 59 10/4/2023

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);
}

Linked List R Patil 60 10/4/2023

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-1th
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).

Linked List R Patil 61 10/4/2023

Single Linked List: Deletion at any Position
Step 3: Free the memory occupied by the nth node i.e. toDelete node.

Linked List R Patil 62 10/4/2023

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;
}

Linked List R Patil 63 10/4/2023

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.");
}
}
}

Linked List R Patil 64 10/4/2023

Circular linked list:
Basic structure of singly circular linked list:

Doubly circular linked list:

Linked List R Patil 65 10/4/2023

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
accessing of elements.

Linked List R Patil 66 10/4/2023

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

Linked List R Patil 67 10/4/2023

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

return 0;
}

Linked List R Patil 68 10/4/2023

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
}
prevNode->next = head; //Links the last node with first node
printf("\nCIRCULAR LINKED LIST CREATED SUCCESSFULLY\n");
}
}

Linked List R Patil 69 10/4/2023

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++;
}while(current != head);
}
}

Linked List R Patil 70 10/4/2023

 If you try to solve problems yourself, then you will learn
many things automatically.

Spend few minutes and then enjoy the study.

Linked List R Patil 71 10/4/2023