Content deleted Content added
m Moving from purely functional programming to purely functional programming |
Adding local short description: "Formatted data in computer science", overriding Wikidata description "persistent data structure for hashes" |
||
| (One intermediate revision by one other user not shown) | |||
Line 1:
{{Short description|Formatted data in computer science}}
{{one source |date=April 2024}}
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 trie, with the actual keys and (optional) values stored at the trie's "final" nodes.<ref name="bagwell">{{cite report
|title=Ideal Hash Trees
| |||