class Solution(object):
tail = TreeNode(-1)
def increasingBST(self, root, tail = None):
dummy = self.tail
def inorder(node):
if not node:
return
inorder(node.left)
self.tail.right = node
node.left = None
self.tail = node
inorder(node.right)
inorder(root)
return dummy.right