I am trying to understand how Merkle trees can be used to find inconsistencies and synchronize the data in two peer nodes.
Suppose I have two nodes with data
Node 1 : [1,3,5,7,8, 10]
Node 2 : [2,6]
Now I can generate the Merkle tree of the data on both of these nodes, however, I have two questions
- How do we compare these two Merkle trees as they would be of different heights
- Even if we consider the Merkle tree of the same height then how do we find the ranges (leaves) that need to be synced.
