I need fast (not worse than about log of the sum of maximum number of nodes and the maximum number of subnodes per node) and fully persistent trie.

I need an easy (quick to code) implementation.

The best thing I came up is a HAMT with each node storing its subnodes as a red-black tree. But that would be (log ...)^2 not (log ...).

Anything more suitable for my problem?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.