Blockchain blocks and Merkle trees

A firm introduction on the blockchain can be found from here at https://blockgeeks.com/guides/what-is-blockchain-technology/ or https://en.wikipedia.org/wiki/Blockchain as a refresher... Now, quickly let me jump onto how these blocks data are getting verified with the right synchronization across all the nodes or blocks? How can we check the consistency, data verification, and data synchronization, etc?

The data structure behind it can be Merkle trees, Merkle tree also known as a hash tree is a data structure used for data verification and synchronization. It is a tree data structure where each non-leaf node is a hash of its child nodes. All the leaf nodes are at the same depth and are as far left as possible. It maintains data integrity and uses hash functions for this purpose.

The more uses of these Merke trees are below:

1. If you wanted to do data verifications across your distributed systems
2. DLTs (Distributed Ledger Technologies) such as Bitcon, Ethereum
3. Well known distributed databases like Apache Cassandra
4. Global supply chain
5. Health care industry etc

You may find more details of the Merkle trees along with sample code implementation can be found from the following sources:
https://www.geeksforgeeks.org/introduction-to-merkle-tree/
https://github.com/quux00/merkle-tree
https://medium.com/@vinayprabhu19/merkel-tree-in-java-b45093c8c6bd
https://www.codeproject.com/Articles/1176140/Understanding-Merkle-Trees-Why-use-them-who-uses-t