Write an algorithm

Question

Write an algorithm for converting BST to circular doubly linked list with space complexity O(1).

Answer 1

//assuming you have a head node with node struct or class already created with BST already constructed

//assuming you have a circularly doubly linked list class already created with a PUSH(input data) function already created

//use recursion, im doing a preorder traversal of the BST

traverse(node* root){

if(root!=nullptr){

traverse(root->left);

traverse(root->right);

pushToCDLL(root->data);

}

}