JHAVÉ - Binary Search Tree
Recommendation |
Recommended |
||||
Link |
|||||
Delivery Method |
Java Web Start |
||||
License |
|||||
Language |
English |
||||
Author |
Tom Naps |
||||
Institution |
University of Wisconsin - Oshkosh |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Visualization for Binary Search Tree. Includes dynamically highlighted pseudo code. Users can select random data, or seed a collection of values to insert/delete |
||||
Evaluation |
The AV is set up as a series of "slides" in one pane, and pseudocode in the adjacent pane. As the user steps through the "slides", the associated pseudocode is highlighted. Occasional questions pop up for the user to answer. This works even when the user is giving their own data... the user has to pre-list the values to be inserted and deleted, and then the whole series of slides is generated by the system for play-back. Does a nice job in general of showing how the values are inserted/deleted. Some of the intermediate steps can be a little hard to follow, especially on delete, since there is an instantaneous jump between slides. |
||||
Step Control; Questions; Random Data; User Data |
|||||
Self Study; Lab Exercise |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2008-07-08 |
||||
Last Visited |
2008-07-08 |
||||
Last Updated |
2008-07-01 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
