Convert BST to a Sorted Circular Doubly Linked List

apple

Given the root of a binary search tree, convert it in place into a sorted circular doubly linked list.

  • Reuse left as the prev pointer and right as the next pointer.
  • The list order mus...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: