A leaf node is a node at the bottom level of a Merkle tree. Each leaf contains the hash of one piece of data, such as a single transaction in a block. Leaves are paired, and the hash of each pair becomes a non-leaf node one level up; the process repeats until a single hash remains, the Merkle root. In Bitcoin, if a level has an odd number of entries the last hash is paired with itself.
Because the root depends on every leaf, changing one transaction changes the root stored in the block header. This structure allows inclusion proofs: to show that a transaction belongs to a block, it is enough to supply its leaf hash and the sibling hashes along the path to the root, a number that grows only logarithmically with the number of transactions. Simplified payment verification by light wallets relies on this property.
Ref 1070001210