procedure find(N, K)
    # N is node to search in (a subtree); K is the key being searched for
    # N should be root the first time find is called

    if N is a non-leaf:
        determine which subtree P[i] potentially contains K, based on keys
            in N

        return find(P[i],K)

    else:  # N is a leaf
        if K is present on this page:
            return pointer associated with K

        else:
            return None