Circular linked list

• Circular linked list is a linked list where

all nodes are connected to form a circle.
There is no NULL at the end. A circular
linked list can be a singly circular linked
list or doubly circular linked list.
Basic Operations
Following are the important operations
supported by a circular list.
insert − Inserts an element at the start of the
list.
delete − Deletes an element from the start of
the list.
display − Displays the list.
 inserting At Beginning of the list
• We can use the following steps to insert a new node
at beginning of the circular 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 head = newNode and newNode→next = head .
• 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 (until 'temp →
next == head').
• Step 6 - Set 'newNode → next =head',
'head = newNode' and 'temp → next = head'.
Displaying a circular Linked List
• We can use the following steps to display the
elements of a circular 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 head → data.
•
 Inserting At End of the list
• We can use the following steps to insert a new node
at end of the circular 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 head = newNode and newNode → next = head.
• 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 == head).
• Step 6 - Set temp → next = newNode and newNode
→ next = head.
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 circular 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 head = newNode and newNode → next = head.
• 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 the 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 - If temp is reached to the exact node after
which we want to insert the newNode then check
whether it is last node (temp → next == head).
• Step 8 - If temp is last node then set temp →
next = newNode and newNode → next = head.
• Step 8 - If temp is not last node then set newNode
→ next = temp → next and temp →
next = newNode.
 Deleting from Beginning of the list
• We can use the following steps to delete a node from
beginning of the circular 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 both 'temp1'
and 'temp2' with head.
• Step 4 - Check whether list is having only one node (temp1
→ next == head)
• Step 5 - If it is TRUE then set head = NULL and
delete temp1 (Setting Empty list conditions)
• Step 6 - If it is FALSE move the temp1 until it reaches to the
last node. (until temp1 → next == head )
• Step 7 - Then set head = temp2 → next, temp1 →
next = head and delete temp2.
 Deleting from End of the list
• We can use the following steps to delete a node from end of the
circular 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 == head)
• Step 5 - If it is TRUE. Then, set head = NULL and delete temp1.
And terminate from 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 temp1 reaches to the last node in the list. (until temp1 →
next == head)
• Step 7 - Set temp2 → next = head and delete temp1.
 Deleting a Specific Node from the list
• We can use the following steps to delete a specific node from the
circular 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 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 (temp1 →
next == head)
• 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
set temp2 = head and keep moving temp2 to its next node
until temp2 reaches to the last node. Then set head = head
→ next, temp2 → next = head and delete temp1.
• Step 10 - If temp1 is not first node then check whether it is
last node in the list (temp1 → next == head).
• Step 1 1- If temp1 is last node then set temp2 →
next = head 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)).
Double Linked List:

• A double linked list is a two-way list in which

all nodes will have two links. This helps in
accessing both successor node and predecessor
node from the given node position. It
provides bi-directional traversing.
• Each node contains three fields:
Left link.
Data.
Right link
• The left link points to the predecessor node and the
right link points to the successor node.
• The data field stores the required data.

Many applications require searching forward and

backward thru nodes of a list.
For example searching for a name in a telephone
directory would need forward and backward scanning
thru a region of the whole list
 The basic operations in a double
linked list are:
• Creation.
• Insertion.
• Deletion.
• Traversing.
The beginning of the double linked list is stored in a "start" pointer
which points to the set to NULL.