A Merkle tree compresses many pieces of data into a single digest called the Merkle root. Leaf nodes store hashes of individual data items (e.g., transactions). Each internal node stores a hash computed from its two children (e.g., hash(left || right)). The root depends on every leaf, so any change in any transaction changes the Merkle root.

Merkle root in block headers
Full content is available with a subscription.
Get full access to all courses on the platform for one year with a single payment.
Unlike other platforms that charge per course, here you get everything for one price, and after one year of use there will be no automatic charge for the following year.