input: Write a function to delete a node in a linked list at a given position.
  assert deleteNode(Node(1, Node(2, Node(3, Node(4, Node(5, None))))), 2).data == 1
  assert deleteNode(Node(1, Node(2, Node(3, Node(4, Node(5, None))))), 4).data == 1
  assert deleteNode(Node(1, Node(2, Node(3, Node(4, None)))), 0).data == 2
output: class Node:
      def __init__(self, data, next=None):
          self.data = data
          self.next = next
  
  def deleteNode(head, position):
      if head is None:
          return None
      
      if position == 0:
          return head.next
  
      current = head
      for i in range(position - 1):
          if current is None or current.next is None:
              return head
          current = current.next
  
      if current.next is None:
          return head
      
      current.next = current.next.next
      return head