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…