












l 
Skip
list insert: analysis




n 
Do a
search for that key




n 
Insert
element in bottomlevel list




n 
With
probability p, recurse to insert in next level



n 
Expected number of lists = 1+ p + p^{2 }+ … = ???






= 1/(1p) = O(1) if p is constant




n 
Total
time = Search + O(1) = O(lg n) expected



l 
Skip
list delete: O(1)

