You may ask, “Isn’t it expensive to verify that a transaction was included within a Merkle Tree?” Don’t worry, we don’t need to recollect every transaction to do that.
We can actually prove it with just one piece of information at each depth.
You’ll notice that we only need to hash Transaction 1 with these two pieces of information: Hash B, and Hash F.
This is actually a great efficiency gain as our tree grows larger.