Implementations So Far
Unsorted list O(1) O(n) O(n)
Trees O(log n) O(log n) O(log n)
Special case: O(1) O(1) O(1)
integer keys
between 0 and k
insert
delete
find
How about O(1) insert/find/delete for any key type?
Previous slide
Next slide
Back to first slide
View graphic version