The lowest level blocks in the tree of a Btree index, called leaf nodes or leaf blocks, contain every indexed key and a rowid that points to the row it is indexing.