4 ms·
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
by attractivechaos 3y ago
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.
- Genbox 3y agoLike the article says, the author did test against an open addressing hash table. He also addressed the resize requirements in the first paragraph, which makes rehashing not a concern.