Given a sorted linked list of integers, write a method(s) to create a balanced binary search tree from the list.

1 -> 2 -> 5 -> 6 -> 8 -> 10 -> 19

     6
   /   \
  2      10
 / \    /  \
1   5   8   19

Input : LinkedList head
Output : TreeNode root