Chapter 3, Problem 7PA

Program Plan Intro

Efficiency of skip lists

Program Plan:

• A skip list is a special type of implementation of a linked list where the nodes are stored in different levels also.
• The structure “skipn” is used to define the skip list nodes.
• The structure “skipL” is used to define the structure of the skip list which is made up of skip list nodes.
• The function “search(int key)” is used to search the key in the skip list.
• The function “insert(int key)” is used to insert the key value inside the skip list.
• The function “deletekey(int key)” is used to delete the key value from the skip list.
• The “main()” function is used to generate the random numbers to insert into the skip list and call the other functions to check the efficiency of the skip list.