Given the head of a singly linked list whose elements are arranged in ascending order, convert it into a height-balanced binary search tree and return the root of the resulting tree.

A height-balanced binary search tree is one where the depth of the two subtrees of every node never differs by more than $1$.

Constraints:

• $0 \leq$ number of nodes in head $\leq 2 \times 10^4$

• $-10^5 \leq$ Node.val $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.