algorithm design techniques figure simple linked list figure linked list with links to two cells ahead figure linked list with links to four cells ahead figure linked list with links to cells ahead accordance with this probability distribution the easiest way to do this is to flip coin until head occurs and use the total number of flips as the node level figure shows typical skip list given thisthe skip list algorithms are simple to describe to perform searchwe start at the highest link at the header we traverse along this level until we find that the next node is larger than the one we are looking for (or nullptrwhen this occurswe go to the next lower level and continue the strategy when progress is stopped at level either we are in front of the node we are looking foror it is not in the list to perform an insertwe figure skip list