← Questions
Convert a BST to a sorted circular doubly linked list
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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 official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding