Merkle Tree

A binary tree where each leaf node is a hash of data and each internal node is the hash of its two children. The root hash (Merkle root) uniquely represents all underlying data. Merkle trees enable efficient proof of inclusion—proving a specific element exists requires only O(log n) hashes. Used in blockchains for transaction verification and state storage.