What Happens If a Block Has an Odd Number of Transactions?

If a block has an odd number of transaction hashes (leaves), the last remaining hash is duplicated and then paired with itself for the next level of hashing. This ensures that all hashes are paired up to continue the process of reducing the tree until the single Merkle Root is achieved.

This duplication is a standard convention in Merkle Tree construction.