hash tree

Definition from Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Noun[edit]

hash tree (plural hash trees)

  1. (computing theory) A tree (data structure) in which every non-leaf node is labelled with the hash of the labels of its children.

Synonyms[edit]

Translations[edit]

Anagrams[edit]