← Amazon questions

Convert BST to sorted circular doubly-linked list

Filed under Amazon

Convert a given Binary Search Tree to a sorted circular doubly-linked list in-place. The left and right pointers in nodes are to be used as previous and next pointers respectively in the converted…

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 Amazon questions

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