Complete Binary Merkle Tree

A Complete Binary Merkle Tree is a Merkle Tree that does not necessarily have $2^n-1$ nodes, but instead it is optimized to use a few nodes as possible, doing so with only the exception of the last node possibly being empty.

See Also

• Nervos Network's CBMT implementation: https://github.com/nervosnetwork/merkle-tree