CentralNotice Hash array mapped trie From Wikipedia, the free encyclopedia Jump to: navigation , search It has been suggested that this article be merged into Hash tree (persistent data structure) . ( Discuss ) Proposed since May 2013. A hash array mapped trie [ 1 ] (HAMT) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie . [ 1 ] It is a refined version of the more general notion of a hash tree . 1 Operation 2 Advantages of HAMTs 3 Problems with HAMTs 4 Implementations 5 References Operation [ edit ] A HAMT is an array mapped trie where the keys are first hashed in order to ensure an even distribution of keys and to ensure a constant key length. In a typical implementation of an array mapped trie, each node may branch to up to 32 other nodes. However, as allocating space for 32 p...