Question: Problem 3. Prove the following basic facts about skip lists, where n is the number of keys. (a) The expected number of nodes is O(n).

Problem 3. Prove the following basic facts about skip lists, where n is the number of keys. (a) The expected number of nodes is O(n). (b) The number of nodes is O(n) with high probability. (c) A new key can be inserted in O(log n) time with high probability
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
