Merkle trees provide a digital footprint of all the transactions in a block by using a mathematical data structure. To create a Merkle tree, every transaction is hashed and converted into one until the last hash remains. This hash is called the Merkle root. Since hash functions change entirely, even with the smallest change in the input data, Merkle trees act as a great source to verify large forms of data. With this, even the slightest change in any data point (data nodes in the image) will impact the Merkle root ultimately.