The idea is simple, we create multiple layers so that we can skip some nodes. See the following example list with 16 nodes and two layers.
The upper layer works as an “express lane” which connects only main outer stations, and the lower layer works as a “normal lane” which connects every station.
Suppose we want to search for 50, we start from first node of “express lane” and keep moving on “express lane” till we find a node whose next is greater than 50. Once we find such a node (30 is the node in following example) on “express lane”, we move to “normal lane” using pointer from this node, and linearly search for 50 on “normal lane”. In following example, we start from 30 on “normal lane” and with linear search, we find 50. Credit: http://www.geeksforgeeks.org/skip-list/
Now coming for the .net implementation, I would suggest please look at the http://www.codeproject.com/Articles/4897/A-Skip-List-in-C
