Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced binary search tree.

Example

The following is a simple and naive solution by converting the linked list to a sorted array and convert the sorted array to the binary search tree.