Convert Sorted List to Binary Search Tree

Total Accepted: 35530 Total Submissions: 128000 My Submissions

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

Show Tags
Depth-first Search Linked List
Have you met this question in a real interview?
Yes
No
When did you meet this question?
1 week ago
1 month ago
3 months ago
6 months ago
More than 6 months ago
How long have you been interviewing?
Not yet started
1 month
3 months
6 months
More than 6 months

Discuss


You have not signed in, cannot submit your code.
Submit failed, try again please.

Submission Result: {[{ statusText }]}More Details

Share your acceptance!

Runtime Error Message: {[{ runtimeError }]}
Last executed input: {[{ lastExecutedTestCase }]}
{[{ resultCodeOutput }]}
Input: {[{ resultWaTestCaseInput }]}
Output: {[{ resultWaTestCaseOutput }]}
Expected: {[{ resultWaTestCaseExpected }]}

Send Feedback