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

head = [-10,-3,0,5,9]Output: [0,-3,9,-10,null,5]Explanation: One possible answer is [0,-3,9,-10,null,5], which represents the shown height balanced BST.
Example 2:
Input:head = []Output: []
Constraints:
- The number of nodes in head is in the range [0, 2 * 104].
- -105
-10 -10 -3 -3 5 9 5 9
Step by Step Solution
3.39 Rating (158 Votes )
There are 3 Steps involved in it
The detailed answer for the above question is provided below class Solution publi... View full answer
Get step-by-step solutions from verified subject matter experts
