N = B-tree root node while (N is not a leaf node) N = scanToFindChild(N,K) tid = scanToFindEntry(N,K) access tuple T using tid
Costone = (D + 1)r