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