B tree vs. B+ tree
B-trees and B+ trees are the workhorses of on-disk databases. B-trees store data in every node; B+ trees keep leaves as a linked list and push all data to the leaves. That single structural difference drives all the practical trade-offs — range scans, cache behavior, and why almost every relational database uses a B+ tree.
