code: private RedBlackTreeNode<Key, Value> deleteMax(RedBlackTreeNode<Key, Value> h) {
  	if (isRed(h.getLeft()))
  	    h = rotateRight(h);
  
  	if (h.getRight() == null)
  	    return null;
  
  	if (!isRed(h.getRight()) && !isRed(h.getRight().getLeft()))
  	    h = moveRedRight(h);
  
  	h.setRight(deleteMax(h.getRight()));
  
  	return balance(h);
      }
docs: delete the key-value pair with the maximum key rooted at h