Why does MongoDB use B-Tree instead of B+Tree for indexing?

Question: Why does MongoDB use B-Tree instead of B+Tree for indexing?

Answer: MongoDB uses B-Tree because it allows faster access to both keys and values at all levels, not just at the leaf level like in B+Tree. This suits MongoDB’s document-based access patterns.