Convert Sorted List to Binary Search Tree

Problem Statement Given the head of a singly linked list where elements are sorted in ascending order, convert it to a height-balanced BST. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subt...