Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
Depth-first Search Linked ListRuntime Error Message: | {[{ runtimeError }]} |
Last executed input: | {[{ lastExecutedTestCase }]} |
Input: | {[{ resultWaTestCaseInput }]} |
Output: | {[{ resultWaTestCaseOutput }]} |
Expected: | {[{ resultWaTestCaseExpected }]} |