This is a generalization of binary tree search.

Search(x, k)

if k in node x

then return x and i such that key_{i}(x) = k

else if x is a leaf

then return NIL

else find i such that key_{i-1}(x) < k < key_{i}(x)

DiskRead(child_{i}(x))

return Search(child_{i}(x), k)

Click mouse to advance to next frame.