In a B+ tree, all records (or pointers to records) are stored in the leaves, and internal nodes store only keys for routing. Leaves are usually linked, so range scans are very fast. This fits disk access well: high fan-out keeps the tree shallow, and linked leaves make ordered reads efficient.