Singly Linked List

The singly linked list is a linear data structure in which each element of the list contains a
pointer which points to the next element in the list. Each element in the singly linked list
is called a node. Each node has two components: data and a pointer next which points
to the next node in the list. The first node of the list is called as head. The last node of
the list contains a pointer to the none.

Consider the above example; node 1 is the head of the list and node 4 is the tail of the
list. Each node is connected in such a way that node 1 is pointing to node 2 which in turn
pointing to node 3. Node 3 is again pointing to node 4. Node 4 is pointing to null as it is
the last node of the list.

Algorithm
1. Create a class SLLNode which has two attributes: data and next. Next is a pointer to the
next node.
2. Create another class which has two attributes: head and tail.
3. Create function will add a new node to the list:
1. Create a new node.
2. It first checks, whether the head is equal to null which means the list is empty.
3. If the list is empty,head will point to the newly added node.
4. If the list is not empty, the new node will be added to end of the list such that
current of next will point to the newly added node.
4. display() will display the nodes present in the list:
1. Define a node current which initially points to the head of the list.
2. Traverse through the list till current points to null.
3. Display each node by making current to point to node next to it in each iteration.

#represent a node of the singly linked list

class sllnode:
def __init__(self,data):
self.data = data
self.next = none

class singlylinkedlist:
#represent the head of the singly linked list
def __init__(self):
self.head = none

#create() will add a create new node to the list

def create(self, data):
#create a new node
newnode =sllnode(data)
 #checks if the list is empty
If self.head is none:
#if list is empty, then head will point to new node
self.head = newnode
else:
#start out looking at the first node
current=self.head
while current.next is not none:
current=current.next
#assign newnode to next of current node
current.next=newnode

#display() will display all the nodes present in the list

def display(self):
#node current will point to head
current = self.head;
if self.head is none:
print("list is empty")
return;
print("nodes of singly linked list: ")
while current is not none:
print(current.data)
current = current.next;

# insert new node at front of list

def insertfront(self, data):
#create a new node
newnode =sllnode(data)
newnode.next=self.head
self.head=newnode

# insert new node at end of list

def insertend(self, data):
#create a new node
newnode =sllnode(data)
#checks if the list is empty
if(self.head == none):
#if list is empty, then head will point to new node
self.head = newnode
else:
#start out looking at the first node
current=self.head
while current.next is not none:
current=current.next
#assign newnode to next of current node
current.next=newnode
# insert new node at given position of list
def insertinbetween(self, data,pos):
#create a new node
newnode =sllnode(data)

#checks if the list is empty

if pos==1:
newnode.next=self.head
self.head = newnode
return
#find the position
current=self.head
for i in range(1,pos-1):
if current current.next is none:
print(“position out of bound”)
current=current.next
#insert tne node
newnode.next= current.next
current.next=newnode

# delete node at front of list

def delfront(self):
if self.head is none:
print(“list is empty”)
return
#print the data of node
print(“the deleted element is: ”,self.head.data)
#check size of the list
if self.head.next is none:
self.head.none
else:
self.head=self.head.next

# delete node at end of list

def delend(self):
if self.head is none:
print(“list is empty”)
return
#check if there is only one node
if self.head.next is none:
print(“the deleted element is: ”,self.head.data)
self.head.none
return
else:
p= self.head
while p.next is not none:
q=p
p=p.next
#remove last node
q.next=head
print(“the deleted element is: ”,p.data)

# delete node at given position of list

def deleteinbetween(self,pos):
if self.head is none:
print(“list is empty”)
return

#checks if the postion is one

if pos==1:
print(“the deleted element is: ”,self.head.data)
self.head = self.head.next
return
p= self.head
for i in rang(1,pos):
if p.next is not none:
print(“position out of bound ”)
q=p
p=p.next
print(“the deleted element is: ”,p.data)
q.next=p.next

#to run programme

list= singlylinkedlist();
list.create(5);
list.create(10);
list.create(15);

print(“The elements in the SLL are :”)

list.display();

Circular Linked List

A circular linked list is a type of linked list in which the last node of the list points back to the first
node (head), forming a loop or circle.

Circular linked list

#represent a node of the circular linked list
class cllnode:
def __init__(self,data):
self.data = data
self.next = none

class circularlinkedlist:
 #represent the head of the circular linked list
def __init__(self):
self.head = none

#create() will add a create new node to the list

def create(self, data):
#create a new node
newnode =cllnode(data)

#checks if the list is empty

If self.head is none:
#if list is empty, then head will point to new node
self.head = newnode
else:
#start out looking at the first node
current=self.head
while current.next != self.head:
current=current.next
#assign newnode to next of current node
current.next=newnode
newnode.next=self.head

#display() will display all the nodes present in the list

def display(self):
#node current will point to head
current = self.head;
if self.head is none:
print("list is empty")
return;
print("nodes of singly linked list: ")
while current !=self.head:
print(current.data)
current = current.next;

# insert new node at front of list

def insertfront(self, data):
#create a new node
newnode =cllnode(data)
newnode.next=self.head
self.head=newnode

# insert new node at end of list

def insertend(self, data):
#create a new node
newnode =cllnode(data)
#checks if the list is empty
if(self.head == none):
 #if list is empty, then head will point to new node
self.head = newnode
newnode.next=self.head
else:
#start out looking at the first node
current=self.head
while current.next is not self.head:
current=current.next
#assign newnode to next of current node
current.next=newnode
newnode.next=self.head

# insert new node at given position of list

def insertinbetween(self, data,pos):
#create a new node
newnode =cllnode(data)

#checks if the list is empty

if pos==1:
newnode.next=self.head
self.head = newnode
return
#find the position
current=self.head
for i in range(1,pos-1):
if current current.next is none:
print(“position out of bound”)
current=current.next
#insert tne node
newnode.next= current.next
current.next=newnode

# delete node at front of list

def delfront(self):
if self.head is none:
print(“list is empty”)
return
#print the data of node
print(“the deleted element is: ”,self.head.data)
#check size of the list
if self.head.next is none:
self.head.none
else:
self.head=self.head.next

# delete node at end of list

def delend(self):
if self.head is none:
print(“list is empty”)
return
print(“the deleted element is: ”,self.head.data)
#check if there is only one node
if self.head.next is none:
print(“the deleted element is: ”,self.head.data)
self.head.none
return
else:
p= self.head
while p.next is not none:
q=p
p=p.next
#remove last node
q.next=none
print(“the deleted element is: ”,p.data)

# delete node at given position of list

def deleteinbetween(self,pos):
if self.head is none:
print(“list is empty”)
return

#checks if the postion is one

if pos==1:
print(“the deleted element is: ”,self.head.data)
self.head = self.head.next
return
p= self.head
for i in rang(1,pos):
if p.next is not none:
print(“position out of bound ”)
q=p
p=p.next
print(“the deleted element is: ”,p.data)
q.next=p.next

#to run programme

list= singlylinkedlist();
list.create(5);
list.create(10);
list.create(15);

print(“The elements in the SLL are :”)

list.display();