Effectively, you get an upside-down binary tree, with each node of the tree connecting to only two nodes below it (hence the name "binary tree"). It has one root hash at the top, which connects to two hashes at level one, each of which again connects to the two hashes at level three, and the structure continues depending upon the number of transaction hashes. Hashing always begins at the lowest level and works its way up.
You are viewing a single comment's thread from: