4 ms·
One of my favourites is treap [1], which doubles as a great excuse to forget how to balance binary trees. It is similarly "probably efficient" as HAMT, mentione
by vnorilo 4y ago
One of my favourites is treap [1], which doubles as a great excuse to forget how to balance binary trees. It is similarly "probably efficient" as HAMT, mentioned in other comments; both require a well-behaving distribution in the hash function.
1: https://en.m.wikipedia.org/wiki/Treap https://en.m.wikipedia.org/wiki/Treap