Search all MERLOT
Click here to go to your profile
Select to go to your workspace
Click here to go to your Dashboard Report
Click here to go to your Content Builder
Click here to log out
Search Terms
Enter username
Enter password
Please give at least one keyword of at least three characters for the search to work with. The more keywords you give, the better the search will work for you.
select OK to launch help window
cancel help

MERLOT II




        

Search > Material Results >

Skip List Demonstration Applet

        

Skip List Demonstration Applet

Logo for Skip List Demonstration Applet
Skip Lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforcing balancing and as a result the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.
Material Type: Presentation
Date Added to MERLOT: March 18, 1998
Date Modified in MERLOT: November 21, 2011
Author:
Send email to wenger@iam.unibe.ch

Details

  • Editor Review (not reviewed)
  • User Rating (not rated)
  • Comments (none)
  • Learning Exercises (none)
  • Personal Collections (none)
  • Accessibility Info (none)

About

Primary Audience:
Mobile Compatibility: Not specified at this time
Language: English
Cost Involved: no
Source Code Available: yes
Accessiblity Information Available: no
Creative Commons: Creative Commons License
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States

Connections



QR Code for this Page

Browse in Categories

Discussion

Discussion for Skip List Demonstration Applet

Log in to participate in the discussions or Register if you are not already a MERLOT member.

Return to Top of Page