This is a generalization of binary tree search.
if k in node x
then return x and i such that keyi(x) = k
else if x is a leaf
then return NIL
else find i such that keyi-1(x) < k < keyi(x)
return Search(childi(x), k)