def dist(a, b):
    return sum((i-j)**2 for i, j in zip(a, b))
def kth(root, k):
    if k < size(root.left):
        return kth(root.left, k)
    elif k > size(root.left):
        return kth(root.right, k - size(root.left) - 1)
    return root.key