One-directional tree (data structure) in which every non-leaf node is labelled with the hash of the labels (or values in case of leaves) of its child nodes, until only a single hash remains at the top of the structure, known as the merkle root.