# 2.3 Delete Middle Node

# Implement an algorithm to delete a node in the middle of a singly linked list,
    # given only access to that node.

# (i.e. any node but the first and last, not necessarily the exact middle)
