Skip List vs. Binary Tree

Posted by Claudiu on Stack Overflow See other posts from Stack Overflow or by Claudiu
Published on 2008-11-02T04:39:55Z Indexed on 2010/05/21 16:20 UTC
Read the original article Hit count: 557

I recently came across the data structure known as a Skip list. They seem to have very similar behavior to a binary search tree... my question is - why would you ever want to use a skip list over a binary search tree?

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about language-agnostic