Those Data structures can not be learned from leetcode- Skiplist

A better concurrency friendy data structure than B Tree.

In previous article — B Tree Step by Step . you can see it is a high performance data structure for searching .however:

  • It is complex .
  • when dealing with rebalance. the cost is high.
  • what if under multi-processing (threading) environment ? it is even more compex .

In this article I only need your 5 mins time to walk through another Data structure which is simple…

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
LORY

A Senior Software Developer/Body builder . to help others enjoy coding and stay healthy