In a B+ tree, the pointers to the actual data records are stored in

Explanation

Internal nodes of a B+ tree hold only keys and child pointers; the leaf nodes hold the record pointers and are chained for sequential access.