Kovac's Heap Visualization
Recommendation |
Unrated |
||||
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: The best feature of this tool is to provide many search trees. This may allow learners to identify how the search trees work by comparison with each other. Randomly generated dataset lets users quickly see the structure of the tree. Users can also construct their own data set. Weaknesses: Like many tree AVs, it just shows the result of the insert or delete operation, without explaining how it works. What is neeed is good textual explanation about each search structure and documentation explaining basic key concepts such as balance factors, re-balancing, etc. The text size of balance factors on the nodes is too small to be recognized (you need to use the "big" version of the applet to see them at all). |
||||
|
|||||
Exploring the Concept; Comparison; Lecture Aid |
|||||
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. |
