Originally posted by Joco Kedves:
How do we know the cost of getting the "tailset" of our set. Can you explain why do you think that it is log n (where n means the number of elements stored in the sorted set)?
Originally posted by Roseanne Zhang:
A little surprising on 2) and 3) if you do not look at the code.