if(/* this is the largest */)
{
    //Look at the 'else' side to see why this works.
    return left;
}else
{
    //The largest is on my right, so if I update my right tree, then I'll be updated, and I can return myself.
    right = right.removeLargestKey();
    return this;
}