Leaf pages in a B* tree contain the content of table rows, that is the application data. The number of entries in a leaf page depends on the total length of the table rows.
The leaf pages in the B* tree are sorted from left to right in ascending order. In other words, each leaf page contains only the table rows that fit its sort area.
The table rows are located in the first section (data section) of the leaf page. The rows in the data section are not sorted by default. The last section of the leaf page contains a position list with addresses that point to the corresponding table rows within the leaf list. The position list is always sorted in ascending order.
The storage space required to store the entire table depends on the length of the separators and on the total length of table rows.