Convert a BST to a sorted circular doubly linked list
Rearrange a binary search tree in place into a circular doubly linked list in sorted order, reusing the left and right pointers as previous and next. Do an in-order traversal that links each node to the one before it, then connect the last node back to the first.
No answer yet. Write the first one; the best answer gets endorsed.