Skip List vs. Binary Search Tree Asked 07 September, 2021 Viewed 1.9K times algorithm language-agnostic data-structures binary-tree skip-lists 54 Votes 7 Answers I recently came across the data structure known as a skip list. It seems to have very similar behavior to a binary search tree. Why would you ever want to use a skip list over a binary search tree? algorithm language-agnostic data-structures binary-tree skip-lists Your reply on this question: Add Reply Cancel 7 Answer Order by Voted Recent Oldest Submit an answer Embed images in Question
