Singly Linked List is PYTHON

 Here is the python code for singly linked list :-

#first of all make a node class as given below class Node: def __init__(self, data): self.data = data self.next = None #now create a linkedlist class to insert and delete the nodes class LL: def __init__(self): self.head = None #function to insert the node at begining def insertatbeg(self, data): newnode = Node(data) if self.head is None: self.head = newnode else: newnode.next = self.head self.head = newnode #function to insert the node at last def insertatend(self, data): newnode = Node(data) if self.head is None: self.head = newnode return else: temp = self.head while temp.next is not None: temp = temp.next temp.next = newnode newnode.next = None #function to insert the node at a given position def insertinbet(self, node, data): if node is None: print("Position is invalid.") return else: newnode = Node(data) newnode.next = node.next node.next = newnode #function to delete the node from the given position #we can also make functions to delete from begining and delete from end def deletenode(self, pos): data = pos.data while pos.data is not data: pos = pos.next pos.data = pos.next.data pos.next = pos.next.next #function to print the linked list def traverse(self): temp = self.head while temp is not None: print(temp.data, "--> ", end="") temp = temp.next new = LL() #here "new" is a included in LL (LinkedList) new.insertatbeg(5) new.insertatbeg(3) new.insertatbeg(2) new.insertatbeg(1) new.insertatend(6) new.insertatend(7) new.insertinbet(new.head.next.next, 4) new.deletenode(new.head) #to print the linkedlist new.traverse() print("None")

2 --> 3 --> 4 --> 5 --> 6 --> 7 --> None

Share it with your friends and help them learning python. In the next post, I will upload the python code for doubly linked list.

John Veer

Contact mail id - john.veer.utube@gmail.com

Contact us for any query

Thanks for reading !

www.basicpythonprogramme.blogspot.com

print("Bye!')