* binary tree has O(log) lookups, inserts, and removals * sorted array has O(log) lookups and O inserts and removals * sorted array probably has lower coefficient for lookups, although we don't ...