Re:MIT’s Introduction to Algorithms, Lecture 12: Skip Lists ...
by tptacek on Friday October 17, 2008 @12:20PM
(#335731)
From Skiena, which buy right now:
Skip lists --- These are somewhat of a cult data structure. Their primary benefits seem to be ease of implementation relative to balanced trees. If you are using a canned tree implementation, and thus not coding it yourself, this benefit is eliminated. I wouldn't bother with them.
Skip lists --- These are somewhat of a cult data structure. Their primary benefits seem to be ease of implementation relative to balanced trees. If you are using a canned tree implementation, and thus not coding it yourself, this benefit is eliminated. I wouldn't bother with them.