← Microsoft questions

Sorted linked list to balanced BST

Filed under Microsoft · Also reported at Qualcomm, ThoughtSpot

Given a singly linked list where elements are sorted in ascending order, convert it into a height-balanced binary search tree (BST).

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.