Re:Skip Lists Done Right
by quinnftw on Monday December 19, 2016 @07:32AM
(#13210984)
Something to note: you state that BST's have logarithmic time in order successor, but many implementations use threaded binary trees which provide an amortized constant successor operation. Great article though.
[ Parent
| on HN ]
There are no comments on this comment yet.