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