Makes sense. Hashes and trees are the two most common ways of implementing an indexed data structure, so it almost had to be one or the other.

A lot of the Collection alternatives you see out there tend to use one type of tree or another. I suppose you could even use both: a relatively fast but short hash (8 to 12 bits?) to select among multiple shallower trees.