input: Write a function to delete a certain element from a linked list. If the element to be deleted is not found in the list, the function should return without making any changes to the list. The function should take a linked list object and a node object to be deleted as inputs.
  
  
  def deleteNode(linked_list, node):
      if linked_list.head is None:
          return
      
      temp = linked_list.head
      
      if temp == node:
          linked_list.head = temp.next
          temp = None
          return
      
      while temp is not None:
          if temp == node:
              break
          prev = temp
          temp = temp.next
      
      if temp is None:
          return
      
      prev.next = temp.next
      temp = None
  
  
  assert deleteNode(linked_list_instance, node_to_delete) == expected_output
output: def deleteNode(linked_list, node):
      if linked_list.head is None:
          return
      
      temp = linked_list.head
      
      if temp == node:
          linked_list.head = temp.next
          temp = None
          return
      
      while temp is not None:
          if temp == node:
              break
          prev = temp
          temp = temp.next
      
      if temp is None:
          return
      
      prev.next = temp.next
      temp = None