•We found that the binary search also allows for fast
retrieval,
–but is limited to array implementations
versus linked
list.
–Because of this, we need to move to
more sophisticated
implementations of tables, using binary search trees!
–These are "nonlinear"
implementations of the ADT table.
