input: Write a python function to create a linked list and delete a node at a given position.
  assert ll.deleteNode(0) == None
  assert ll.deleteNode(2) == None
  assert ll.deleteNode(4) == None
output: class Node:
      def __init__(self, data):
          self.data = data
          self.next = None
  
  class LinkedList:
      def __init__(self):
          self.head = None
  
      def append(self, new_data):
          new_node = Node(new_data)
          if self.head is None:
              self.head = new_node
              return
          last = self.head
          while last.next:
              last = last.next
          last.next = new_node
  
      def deleteNode(self, position):
          if self.head is None:
              return None
  
          temp = self.head
  
          if position == 0:
              self.head = temp.next
              temp = None
              return None
  
          for i in range(position - 1):
              temp = temp.next
              if temp is None:
                  return None
  
          if temp is None or temp.next is None:
              return None
  
          next = temp.next.next
          temp.next = None
          temp.next = next
          return None