Kovac's Skip List
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Kubo Kovac |
||||
Institution |
Comenius University, Slovakia |
||||
Project |
Kovac's Tree Project |
||||
Works |
Yes |
||||
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. |
||||
|
|||||
Exploring the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2007 |
||||
Last Visited |
2008-06-12 |
||||
Last Updated |
2007 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
