input: Write a function to delete a node from a linked list. The function should take the node to be deleted as an input parameter and modify the linked list accordingly. If the node to be deleted is the head node, the head should be updated to the next node. If the node is not found in the linked list, the function should do nothing.
  
  def deleteNode(self, node):
      if self.head == node:
          self.head = node.next
      else:
          current = self.head
          while current is not None:
              if current.next == node:
                  current.next = node.next
                  break
              current = current.next
  
  assert deleteNode(LinkedList(), Node(3)) is None
  assert deleteNode(LinkedList(), None) is None
  assert deleteNode(LinkedList(), Node(3)) is None
output: def deleteNode(self, node):
      if self.head == node:
          self.head = node.next
      else:
          current = self.head
          while current is not None:
              if current.next == node:
                  current.next = node.next
                  break
              current = current.next