Talk:Hash array mapped trie

This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing

???

This article has not yet received a rating on the project's importance scale.

This article is supported by WikiProject Computer science.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

What Is An Array Mapped Trie?

The word "trie" has been linked to the article of the same name. However there's no information there or anywhere on Wikipedia as to what an array mapped trie is. This makes the introduction of limited use in my opinion.

refined version of a hash tree?

It is unclear in what way a HAMT is a refined version of a hash tree. AFAICT, no refinements over hash trees are mentioned. --MarSch (talk) 14:05, 15 March 2016 (UTC)[reply]

Performance?

The "advantages" section hints at the structure having a good performance, but no performance figures (preferably as asymptotic complexity) are given. AmirOnWiki (talk) 14:23, 20 June 2025 (UTC)[reply]