Scribd
Upload
8 views7 pages

Singly Linked List

A singly linked list is a sequence of nodes where each node points to the next, with the first node's address stored in a reference called 'head'. Key operations include insertion (at the beginning, end, or specific location), deletion (from the beginning, end, or a specific node), and displaying the list. The document outlines detailed steps for performing these operations on a singly linked list.

Uploaded by

Prajwal Narute
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views7 pages

Singly Linked List

A singly linked list is a sequence of nodes where each node points to the next, with the first node's address stored in a reference called 'head'. Key operations include insertion (at the beginning, end, or specific location), deletion (from the beginning, end, or a specific node), and displaying the list. The document outlines detailed steps for performing these operations on a singly linked list.

Uploaded by

Prajwal Narute
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Singly Linked List

Singly Linked List :

Single linked list is a sequence of nodes in which every


node has link to its next node in the sequence.

Important Points to be Remembered

 In a single linked list, the address of the first node is always stored in a
reference node known as "front" (Some times it is also known as "head").

 Always next part (reference part) of the last node must be NULL.
Example

Operations on Single Linked List


The following operations are performed on a Single Linked List
 Insertion
 Deletion
 Display

Insertion

In a single linked list, the insertion operation can be performed in three ways. They
are as follows...
1. Inserting At Beginning of the list
2. Inserting At End of the list
3. Inserting At Specific location in the list

www.vectorindia.org 1
Singly Linked List

Inserting At Beginning of the list


We can use the following steps to insert a new node at beginning of the single
linked list...
 Step 1 - Create a newNode with given value.
 Step 2 - Set newNode→next = head and head = 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.

www.vectorindia.org 2
Singly Linked List

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
given value, here value 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!!!

www.vectorindia.org 3
Singly Linked 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'

Deletion
In a single linked list, the deletion operation can be performed in three ways. They
are as follows...
1. Deleting from Beginning of the list
2. Deleting from End of the list
3. Deleting a Specific Node

www.vectorindia.org 4
Singly Linked List

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 -Set head = temp → next, and delete temp.

Deleting from End of the list


We can use the following steps to delete 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)

www.vectorindia.org 5
Singly Linked List

 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.

Deleting a Specific Node from the list


We can use the following steps to delete a specific node from 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 - 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 temp1 becomes NULL(reached end of the list) then display 'Given
node not found in the list! Deletion not possible!!!'. And terminate the
function.

www.vectorindia.org 6
Singly Linked List

 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)).

Displaying a Single Linked List


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
becomes NULL

Note :

Reference Books : Taken contents and diagrams from various websites.

www.vectorindia.org 7

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy