1. No, because there is no inverse operation to minimization.

2.
    node = x
    while node != null:
        if node.left == null:
            leftheight = -1
        else:
            leftheight = node.left.height
        if node.right == null:
            rightheight = -1
        else:
            rightheight = node.right.height
        node.height = 1 + max(leftheight, rightheight)
        node = node.parent

3.
    def jump(x,i):
        return unrank(rank(x) + i)