For i = 1, 2, . . ., n– 1, pointer P i either points to a file record with search-key value K i , or to a bucket of pointers to file records, each record having search-key value K i . Only need bucket structure if search-key does not form a primary key.
If L i , L j are leaf nodes and i < j, L i ’s search-key values are less than L j ’s search-key values
P n points to next leaf node in search-key order
12.18 Database System Concepts - 5 th Edition. Properties of a leaf node: