are also doubly linked lists search and update operations in skip list the skip list structure allows for simple dictionary search and update algorithms in factall of the skip list search and update algorithms are based on an elegant skipsearch method that takes key and finds the position of the entry in list such that has the largest key (which is possibly -less than or equal to searching in skip list suppose we are given search key we begin the skipsearch method by setting position variable to the top-mostleft position in the skip list scalled the start position of that isthe start position is the position of storing the special entry with key we then perform the following steps (see figure )where key(pdenotes the key of the entry at position if below(pis nullthen the search terminates--we are at the bottom and have located the largest entry in with key less than or equal to the search key otherwisewe drop down to the next lower level in the present tower by setting below( starting at position pwe move forward until it is at the right-most position on the present level such that key( < we call this the scan forward step note that such position always existssince each level contains the keys and in factafter we perform the scan forward for this levelp may remain where it started in any casewe then repeat the previous step figure example of search in skip list the positions visited when searching for key are highlighted in blue