Sparse Merkle Tree

In our description of the Merkle Tree, we had a binary-tree with 8 leaf nodes, and we had filled all of them with elements of a vector $\vec{v}=[m,y,v,e,c,t,o,r]$. What if we did not have data to fill the entire leaves?