The Algorithm Visualization Catalog is a comprehensive collection of links to algorithm visualizations, or AVs.

Kovac's Skip List

Link(s)
http://people.ksp.sk/~kuko/bak/
Topic(s)
Skip list, Search Structures



Recommendation
  
Lecture Aide Has Potential
Self-study Supplement Has Potential
Standalone Has Potential
Debugging Aide Not Recommended
Works?
Yes
Delivery Method(s)
Java Applet
Project
Kovac's Tree Project
Project Relationship
Part of project
Language(s)
English, Slovak
Author(s)
Kubo Kovac
Institution(s)
Comenius University, Slovakia
Activity Level(s)
N/A
Source Code License
Unavailable
First Published
N/A
Last Modified
N/A

Description

This AV shows various search trees such as AVL, BST, B tree, red-black tree, AA tree, skiplist, heap, treap, scapegoat tree and splay tree. It demonstrates insertion, deletion and search. Users can start with randomly generated input dataset or user’s own data. For the data structuers where this is relevent, it provides balance factors such as ‘+’, ‘-‘ and ‘.’ by the nodes.

Evaluation

Strengths: Very clearly shows the steps that take place when a value is inserted, deleted or searched in the skiplist. That makes this the best choice from the limited offerings of skiplist AVs currently available. Weaknesses: There is a major problem that after only a few nodes have been inserted, the skiplist runs off the display. Since there is no scrolling, you just can’t see the rest of the skiplist. If this were fixed, this AV would be "Recommended." The skiplist layout is not very attractive.

Usage Notes
N/A
Field Report(s)
References
N/A
Rating
0
No votes yet
Your rating: None
AV of the Day
No
Score
43