Skip lists are taught as a standard of the undergrad CS curriculum at many major universities.  However, from my reading* I can't find any practical situation where you would use a skip list over  a treap. Also they have the same asymptotic performance  for all the main operations.As a result this left me wondering:Should you ever choose a skip list over a treap?*A few web links that suggest that treaps are faster in practice or a just very fast in practice.http://pinporelmundo.blogspot.co.uk/2011/06/skip-lists-compared-with-treaps-and-red.htmlhttps://stackoverflow.com/a/16009599/2179021https://stackoverflow.com/a/18303163/2179021and here is a link suggesting that skip lists are almost never usefulhttps://www.quora.com/Why-arent-skip-lists-used-more-often-instead-of-balanced-trees
Would you ever use a skip list over a treap?
data structures;efficiency