Convert a BST to a Sorted Circular Doubly Linked List

Asked at Pinterest · Coding Questions · Difficulty: Medium · Last asked Apr 18, 2026

Convert a binary search tree into a sorted circular doubly linked list, reusing the tree's own nodes. After the conversion, the `left` pointer of each node leads to its predecessor in sorted order and the `right` pointer to its successor.

Loading the problem…