Update singly_LinkedList.py

Author: avkaran-singh

data_structures/LinkedList/singly_LinkedList.py

@@ -2,7 +2,6 @@ class Node:#create a Node
     def __int__(self,data):
         self.data=data#given data
         self.next=None#given next to None
-
 class Linked_List:
     pass
     def insert_tail(Head,data):#insert the data at tail
@@ -19,8 +18,7 @@ def insert_tail(Head,data):#insert the data at tail
             newNod.data = data
             newNod.next = None
             tamp.next=newNod#put the newnode into last node
-        return Head#return first node  of  linked list
-    
+        return Head#return first node  of  linked list  
     def insert_head(Head,data):
         tamp = Head
         if (tamp == None):
@@ -33,20 +31,17 @@ def insert_head(Head,data):
             newNod.data = data
             newNod.next = Head#put the Head at NewNode Next
             Head=newNod#make a NewNode to Head
-        return Head
-    
+        return Head   
     def Print(Head):#print every node data
         tamp=Node()
         tamp=Head
         while tamp!=None:
             print(tamp.data)
             tamp=tamp.next
-
     def delete_head(Head):#delete from head
         if Head!=None:
             Head=Head.next
         return Head#return new Head
-
     def delete_tail(Head):#delete from tail
         if Head!=None:
             tamp = Node()
@@ -55,7 +50,6 @@ def delete_tail(Head):#delete from tail
                 tamp = tamp.next
             tamp.next=None#delete the last element by give next None to 2nd last Element
         return Head
-
     def isEmpty(Head):
         if(Head==None):#check Head is None  or Not
             return True#return Ture if list is empty