Data Structure Visualization - AVL Tree
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
David Galles |
||||
Institution |
University of San Francisco |
||||
Project |
|||||
Works |
Yes |
||||
Description |
This visualization demonstrates the behavior of an AVL tree. Users can insert and delete values. Rotations are shown. |
||||
Evaluation |
The visualization shows the AVL-tree with the height of the subtree in every node. The user is allowed to enter data to insert, delete, or search items to/from the tree. The search path in every operation is visualized and rotations are smoothly animated. The speed of the animation can be changed by the user. The main problem is that there is no code and no explanation for what is happening. Rotations are shown... but it is an animation that the user has no control over or detailed explanation of the steps. |
||||
Animation Only; User Data |
|||||
Lecture Aid; Debugging |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-01 |
||||
Last Visited |
2008-07-01 |
||||
Last Updated |
2006-04-05 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
