input: Write a function to delete a given node from a linked list. The function should traverse the list and find the node to be deleted, then unlink it from the list. The function should handle the case where the node to be deleted is the head of the list. If the node is not found, the function should return without making any changes to the list.
  
  def deleteNode(self, node):
      temp = self.head
      if temp is not None and temp == node:
          self.head = temp.next
          temp = None
          return
      while temp is not None:
          if temp == node:
              break
          prev = temp
          temp = temp.next
      if temp == None:
          return
      prev.next = temp.next
      temp = None
  
  assert deleteNode(LinkedList, Node(10))==None
output: def deleteNode(self, node):
      temp = self.head
      if temp is not None and temp == node:
          self.head = temp.next
          temp = None
          return
      while temp is not None:
          if temp == node:
              break
          prev = temp
          temp = temp.next
      if temp == None:
          return
      prev.next = temp.next
      temp = None