Adding a Ternary Search Tree

[alkeldi]

Hash tables are an excellent data structure for amortized constant time operations. But, calculating the hash is not actually O(1). It's more like O(h), where h is the length of the hashed key.
With a ternary search tree, it's possible to get similar results to those obtained from a Hash Table without the need of resizing the table, or having extra unused entries as with the hash table.

[srdja]

Yeah, it sounds good. We already have two different tables with different time/space properties, so I don't see why we shouldn't add another. More tools in the toolbox.