Lines Matching full:lookups
63 * paper describes. The 2-3 tree gives O(lg N) lookups, but insertion and removal also
65 * insertions and removals was greater than the cost of infrequent O(N) lookups with the
68 * Only type 2 vertices (see paper) require the O(N) lookups, and these are much less
