Optimize sparse Merkle subtree hashing

Brought up at https://github.com/0xPolygonMiden/crypto/pull/334#issuecomment-2438864354, we can build a fully-balanced tree four times more efficiently than we can build an SMT subtree of the same size. This is reasonable for now, but we can and should optimize this better in the future.