Key Mapping

Balanced binary search trees are generally implemented such that key values are mapped to, or associated with, an object that you are interested in storing.
- java.util.TreeMap.put(Comparable key, Object o)
Only the keys are used in creating and maintaining the topology of the 2-3 Tree.
Keys are generally much, much smaller than the objects associated with them.

Balanced binary search trees are generally implemented such that key values are mapped to, or associated with, an object that you are interested in storing.