Algoverse_adesh_33

 def insertAtBegining(self,head,x):
        temp=Node(x)
        temp.next=head
        return temp
    .
    def insertAtEnd(self,head,x):
        if head is None:
            return Node(x)
        curr=head
        while curr.next:
            curr=curr.next
        curr.next=Node(x)
        return head