Abstract
In Skip list data structure, linked lists are used. Nodes are allocated to different levels as linked list. By the help of these levels operations like item search, insertion, or removal can be performed easily (O(lg N)). However, in this data structure in the operation of adding nodes to levels, higher levels can be produced than needed. Creating higher levels affects the performance of this data structure negatively. In this article how randomly creation of levels and different “p” thresholds (0.1, 0.25, 0.5, 0.75, 0.9) affect the performance is studied and solutions are proposed. The problem of creating higher levels in Skip list data structure is solved by introducing optimum p thresholds. Hence, ideal p threshold levels are created for Skip list data structure
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
