Algorithm:

1. find rightmost node in bottom level, save its value X, delete the node.

2. put X into the node containing V: if it is smaller than its parent sift up, if it is larger than either of its children sift down.

Delete 15

Delete 50