Flatten BST to sorted list - GFG

prev = None
def inorder(node):
  if node is None:
    return None
  solve(node.left)
  if prev is None:
    head = prev
  else:
    prev.right = node
    prev.left = None
    prev = node
  solve(node.right)