Merkle Trees Checkpoint

1. If a level has an odd number of hashes, Bitcoin-style trees:

Duplicate the last hash Drop the last hash Pad with zeros Shuffle hashes

2. A Merkle proof size grows with:

O(log N) O(N) O(N^2) O(1)

3. True/False: Changing transaction order changes the Merkle root.