Search

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.