class ListNode:

def __init__(self, val = 0, next= None):

self.val = val

self.next = next

class Singly():

def __init__(self):

self._first = None

self._last = None

##Public functions below

## Private functions below

For a singly linked list, perform the following operations: 1. Append, prepend, add an element to any place(find) 2. Delete (can apply to delete front, delete back, delete any element) 3. Find the midpoint 4. Reverse iteratively You need to build a python list first