I have implemented a HAMT (hash array mapped trie) in Pascal It has the same tree structure with a lot of children. But the hash is used as key, so they need n

I have implemented a HAMT (hash array mapped trie) in Pascal It has the same tree structure with a lot of children. But the hash is used as key, so they need no balancing. It is just assumed the hash is sufficiently well distributed.