A main advantage of trees is that keys are ordered. Data structures in this post are not. In this case, an open addressing hash table will be smaller and times faster. If rehashing is a concern, a standard AVL or red-black tree is still the preferred choice.