Archives

Have you considered doing an amortized flattening…

Comment on “BList” by bramcohen

Have you considered doing an amortized flattening of the data structure, so that if someone does enough lookups without any inserts or deletes the time to do a lookup will eventually fall from O(log(n)) to O(1) ?

Share

Comments are closed.