bst_2_circular_linked_list.py

prev = None
def convert(node,head,entered):
    global prev
    if node != None:
        convert(node.left, head,entered)
        node.left = prev
        
        if prev == None:
            head[0] = node
        else:  
            prev.right = node
        
        
        head[0].left = node
        rightchild = node.right
        node.right = head[0]
        
        prev = node
        
        convert(rightchild,head,entered)
        
def printInorder(root):
    if root == None:
        return
    printInorder(root.left)
    print(root.val)
    printInorder(root.right)
    
def BSTtoLL(node):
    root = node
    arr = [None]
    prev = None
    convert(root, arr, False)
    head = arr[0]
    temp = head
    result = ""
    while head != None:
        result += str(head.val) + " "
        head = head.right
        if head == temp:
            break
            
    print(result.strip())