On: Ask HN: What are some cool but obscure data structures you know about?

[lizardactivist]

The Trie is pretty cool. I think it's a bit obscure because the memory use can grow quite fast.

[pjscott → lizardactivist]

That depends very much on how the trie is represented in memory. Something like a burst trie or HAT trie is usually very compact!