input: Write a function to delete a certain node from a linked list. The function should take the node to be deleted as input and update the linked list accordingly. If the node to be deleted is not found, no changes should be made to the linked list.
  
  class Node:  
      def __init__(self, data):  
          self.data = data
          self.next = None
    
  class LinkedList:  
      def __init__(self):  
          self.head = None
    
      def deleteNode(self, node): 
          temp = self.head  
          if (temp is not None):  
              if (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 LinkedList().deleteNode(Node(5)) == None
  assert LinkedList().deleteNode(Node(10)) == None
  assert LinkedList().deleteNode(Node(15)) == None
  assert LinkedList().deleteNode(Node(20)) == None
  assert LinkedList().deleteNode(None) == None
output: def deleteNode(self, node): 
      temp = self.head  
      if (temp is not None):  
          if (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