Creates a new tree map using the elements of two parallel arrays and the given
Returns a node with key k in the balanced tree, creating one with defRetValue if
Compares two keys in the right way. This method uses the #actualComparator if it
is non- null. Other
Returns the entry corresponding to the given key, if it is in the tree; null,
Finds the parent of an entry.
Reads the given number of entries from the input stream, returning the