The following is the Algorithm for Single Linked List:
Insertion
In a single linked list, the insertion operation can be performed in
three ways. They are as follows...
➢ Inserting at Beginning of the list
➢ Inserting at Specific location in the list
➢ Inserting at End of the list
Insertion at the beginning of the singly linked lists
Step 1. Create a new node and assign the address to any node
say ptr.
Step 2. OVERFLOW,IF(PTR = NULL)
write : OVERFLOW and EXIT.
Step 3. ASSIGN INFO[PTR] = ITEM
Step 4. IF(START = NULL)
ASSIGN NEXT[PTR] = NULL
ELSE
ASSIGN NEXT[PTR] = START
Step 5. ASSIGN START = PTR
Step 6. EXIT
Inserting at Specific location in the list (After a Node)
We can use the following steps to insert a new node after a node
in the single linked list...
Step 1: Create a newNode with given value.
Step 2: Check whether list is Empty (head == NULL)
Step 3: If it is Empty then, set newNode → next = NULL and head
=
newNode.
Step 4: If it is Not Empty then, define a node pointer temp and
initialize
with head.
Step 5: Keep moving the temp to its next node until it reaches to
the node
after which we want to insert the newNode (until temp1 → data is
equal to location, here location is the node value after which we
want to insert the newNode).
Step 6: Every time check whether temp is reached to last node
or not. If it
is reached to last node then display 'Given node is not found in
the
list!!! Insertion not possible!!!' and terminate the function.
Otherwise move the temp to next node.
Step 7: Finally, Set 'newNode → next = temp → next' and
'temp → next = newNode'
Inserting At End of the list
We can use the following steps to insert a new node at end of the
single linked list...
Step 1: Create a newNode with given value and newNode → next
as NULL.
Step 2: Check whether list is Empty (head == NULL).
Step 3: If it is Empty then, set head = newNode.
Step 4: If it is Not Empty then, define a node pointer temp and
initialize
with head.
Step 5: Keep moving the temp to its next node until it reaches to
the last
node in the list (until temp → next is equal to NULL).
Step 6: Set temp → next = newNode.
Tech CSE (R23) (Semester –II) Data Structures
R SESHU M.C.A, (M. Tech), Department of CSE. 4 Universal
College of Engineering & Technology, Parecharla
In a single linked list, the deletion operation can be
performed in three ways. They are as follows...
1. Deletion at beginning of the list. 2. Deletion at the middle of
the list. 3. Deletion at the end of the list.
1. Deleting from Beginning of the list
We can use the following steps to delete a node from beginning of
the single linked list...
Step 1: Check whether list is Empty (head == NULL)
Step 2: If it is Empty then, display 'List is Empty!!! Deletion is not
possible' and terminate the function.
Step 3: If it is Not Empty then, define a Node pointer 'temp' and
initialize with head.
Step 4: Check whether list is having only one node (temp → next
== NULL)
Step 5: If it is TRUE then set head = NULL and delete temp
(Setting Empty list conditions)
Step 6: If it is FALSE then set head = temp → next, and delete
temp.
Deleting from End of the list
2. Deleting a specific node or middle of the list
Step 1: Check whether list is Empty (head == NULL)
Step 2: If it is Empty then, display 'List is Empty!!! Deletion is not
possible' and terminate the function.
Step 3: If it is Not Empty then, define two Node pointers 'temp1'
and 'temp2' and initialize 'temp1' with head.
Step 4: Keep moving the temp1 until it reaches to the exact
node to be deleted or to the last node. And every time set 'temp2
= temp1' before moving the 'temp1' to its next node.
Step 5: If it is reached to the last node then display 'Given node
not found in the list! Deletion not possible!!!'. And terminate the
function.
Step 6: If it is reached to the exact node which we want to
delete, then check whether list is having only one node or not
Step 7: If list has only one node and that is the node to be
deleted, then set head = NULL and delete temp1 (free (temp1)).
Step 8: If list contains multiple nodes, then check whether temp1
is the first node in the list (temp1 == head).
Step 9: If temp1 is the first node then move the head to the next
node (head = head → next) and delete temp1.
Step 10: If temp1 is not first node then check whether it is last
node in the list (temp1 → next == NULL).
Step 11: If temp1 is last node then set temp2 → next = NULL
and delete temp1 (free (temp1)).
Step 12: If temp1 is not first node and not last node then set
temp2 → next = temp1 → next and delete temp1 (free (temp1)).
3. Deleting a node from end of the single linked list
Step 1: Check whether list is Empty (head == NULL)
Step 2: If it is Empty then, display 'List is Empty!!! Deletion is not
possible' and terminate the function.
Step 3: If it is Not Empty then, define two Node pointers 'temp1'
and 'temp2' and initialize 'temp1' with head.
Step 4: Check whether list has only one Node (temp1 → next ==
NULL)
Step 5: If it is TRUE. Then, set head = NULL and delete temp1.
And terminate the function. (Setting Empty list condition)
Step 6: If it is FALSE. Then, set 'temp2 = temp1 ' and move
temp1 to its next node. Repeat the same until it reaches to the
last node in the list. (until temp1 → next == NULL)
Step 7: Finally, Set temp2 → next = NULL and delete temp1.
We can use the following steps to display the elements of a
single linked list...
Step 1: Check whether list is Empty (head == NULL)
Step 2: If it is Empty then, display 'List is Empty!!!' and terminate
the function.
Step 3: If it is Not Empty then, define a Node pointer 'temp' and
initialize with head.
Step 4: Keep displaying temp → data with an arrow (--->) until
temp reaches to the last node
Step 5: Finally display temp → data with arrow pointing to NULL
(temp → data ---> NULL).
#include <stdio.h> #include <string.h> #include <stdlib.h>
#include <stdbool.h>
struct node { int data; int key;
struct node *next;
};
struct node *head = NULL; struct node *current = NULL;
//display the list void printList() {
struct node *ptr = head; printf("\n[ ");
//start from the beginning while(ptr != NULL) {
printf("(%d,%d) ",ptr->key,ptr->data); ptr = ptr->next;
printf(" ]");
//insert link at the first location void insertFirst(int key, int data) {
//create a link
struct node *link = (struct node*) malloc(sizeof(struct node));
link->key = key; link->data = data;
//point it to old first node link->next = head;
//point first to new first node head = link;
//delete first item
struct node* deleteFirst() {
//save reference to first link struct node *tempLink = head;
//mark next to first link as first head = head->next;
//return the deleted link
return tempLink;
//is list empty bool isEmpty() {
return head == NULL;
int length() {
int length = 0;
struct node *current;
for(current = head; current != NULL; current = current->next)
{ length++;
return length;
//find a link with given key struct node* find(int key) {
//start from the first link struct node* current = head;
//if list is empty if(head == NULL) {
return NULL;
//navigate through list while(current->key != key) {
//if it is last node
if(current->next == NULL) { return NULL;
} else {
//go to next link
current = current->next;
/if data found, return the current Link return current;
//delete a link with given key struct node* delete(int key) {
//start from the first link struct node* current = head;
struct node* previous = NULL;
//if list is empty if(head == NULL) {
return NULL;
//navigate through list while(current->key != key) {
//if it is last node
if(current->next == NULL) { return NULL;
} else {
//store reference to current link previous = current;
//move to next link current = current->next;
//found a match, update the link if(current == head) {
//change first to point to next link head = head->next;
} else {
//bypass the current link previous->next = current->next;
return current;
}
void reverse(struct node** head_ref) { struct node* prev = NULL;
struct node* current = *head_ref; struct node* next;
while (current != NULL) { next = current->next; current->next =
prev; prev = current;
current = next;
*head_ref = prev;
