Range query complexity in a B+-tree

In a B+-tree (unlike a classic B-tree), internal nodes hold only routing keys, never records: every record lives in a leaf, and the leaves are additionally threaded into a sorted linked list. Given this, what is the complexity of a range query returning k matching records?

4 of 46 in Data Structures & Algorithms