← Goldman Sachs questions

Convert BST to sorted doubly linked list in-place

Filed under Goldman Sachs

Transform a Binary Search Tree into a sorted Doubly Linked List in-place without using extra space for new nodes, only modifying the existing pointers.

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 Goldman Sachs questions

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