A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.Construct a deep copy of the list.

Given a non-empty, singly linked list with head node head, return a middle node of linked list.

Reverse a singly linked list.