Content deleted Content added
actually, HAMTs could be described here as well; the basic properties listed in their article are due to them being hash trees |
also hash trie |
||
Line 1:
{{mergefrom|Hash array mapped trie}}
In computer science, a '''hash tree''' (or '''hash [[trie]]''') is a [[persistent data structure]] that can be used to implement [[Set (abstract data type)|sets]] and [[Associative array|maps]], intended to replace [[hash table]]s in [[purely functional]] programming. In its basic form, a hash tree stores the [[Hash function|hashes]] of its keys, regarded as strings of bits, in a
|title=Ideal Hash Trees
|author=Phil Bagwell
| |||