What is "hash tree"

n. (context comptheory English) A tree (data structure) in which every non-leaf node is labelled with the hash of the labels of its children.

In computer science, hash tree may refer to:

• Hashed array tree
• Hash tree (persistent data structure), an implementation strategy for sets and maps
• Merkle tree

In computer science, a hash tree (or hash trie) is a persistent data structure that can be used to implement sets and maps, intended to replace hash tables in purely functional programming. In its basic form, a hash tree stores the 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.

Hash array mapped tries and Ctries are refined versions of this data structure, using particular type of trie implementations.