Is it possible to use a Perl hash in a manner that has O(log(n)) lookup and insertion?
O(log(n))
By default, I assume the lookup is O(n) since it\'s
O(n)
A perl hash is a hash-table, so it already has O(1) insertion and lookup.