ch09 section on Merkle trees has potentially contradictory information on the number of hashes required to prove a data element is in the tree

[0xfauzi]

When N data elements are hashed and summarized in a merkle tree, you can check to see if any one data element is included in the tree with at most 2*log~2~(N) calculations, making this a very efficient data structure.

and

To prove that a specific transaction is included in a block, a node only needs to produce log~2~(N) 32-byte hashes, constituting an authentication path or merkle path connecting the specific transaction to the root of the tree. This is especially important as the number of transactions increases, because the base-2 logarithm of the number of transactions increases much more slowly

seem to contradict each other.

To prove that a specific data element exists in the merkle tree, shouldn't that only need log2(N) hashes? Under what circumstances would you need twice that number of hashes?