code: private RedBlackTreeNode<Key, Value> max(RedBlackTreeNode<Key, Value> x) {
  	// assert x != null;
  	if (x.getRight() == null)
  	    return x;
  	else
  	    return max(x.getRight());
      }
docs: the largest key in the subtree rooted at x; null if no such key