Challenge: Middle of the Linked List

Statement

Given the head of a singly linked list, return the middle node of the linked list.

If there are two middle nodes, return the second middle node. This happens when the length of the list is even, and the second middle node occurs at $\frac {length}{2}$. Otherwise, if the length of the list is odd, the middle node occurs at $\frac {length}{2}+1$.

Constraints:

Let n be the number of nodes in a linked list.

• $1 \leq$ n $\leq 100$
• $1 \leq$ node.data $\leq 100$
• head $\neq$ NULL

Examples