BalancedTree allows key-value mapping with arbitrary keys, as long as they
can be ordered. By default,
Reflect.compare is used in the
method, which can be overridden in subclasses.
Operations have a logarithmic average and worst-case cost.
Iteration over keys and values, using
Creates a new BalancedTree, which is initially empty.
Returns the value
key is bound to.
key is not bound to any value,
null is returned.
key is null, the result is unspecified.
Iterates over the keys of
This operation is performed in-order.