LeetCode – Convert Sorted List to Binary Search Tree (Java)

LeetCode – Convert Sorted List to Binary Search Tree (Java)

by

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. Thoughts If you are given an array, the problem is quite straightforward. But things get a little more complicated when you have a singly linked list instead of an array. Now you no longer have random … Read more