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 a only a single hash remains at the top of the structure, known as the merkle root.
Article (+6/-4 characters)
Condensing large amounts of data so that less memory / disk space is needneeded to store it and it's easier / faster to transmit across a network.