Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Zip Trees. Parent comment
This isn't the case. Half the inserts become leaves, which don't require restructuring but do require O(lg n) to find the insertion point.
There are no comments on this comment yet.
This isn't the case. Half the inserts become leaves, which don't require restructuring but do require O(lg n) to find the insertion point.