Find the middle of a Linked ListEasy
Given a singly linked list, write a function that returns the middle node.
For example, given the head of the input linked list:
(3) -> (9) -> (7)
Your function should return the node with
You can assume that the list has an odd number of nodes.