Two algorithms for finding items in an M-way search tree are described in this section. The first is a naıve implementation using linear search. The second version improves upon the first by using a binary search.