JHAVÉ - Red-Black Tree
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Web Start |
||||
License |
|||||
Language |
English |
||||
Author |
Tom Naps |
||||
Institution |
University of Wisconsin - Oshkosh |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Visualization for Red-Black Search Tree. Includes dynamically highlighted pseudo code. |
||||
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. Gives a reasonably clear presentation for the steps of an insertion, using a canned data set. No delete. |
||||
Step Control; Questions; Canned Data |
|||||
Self Study; Lab Exercise |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
Clicking on the link above will take you to a login page for Jhave. If you do not want to create an account at jhave.org, use anonymous@anonymous.com as your user name and anonymous as your password when you are asked to login. You will then be taken to the Jhave page for this AV. Some Jhave AVs include a tutorial on how the AV itself or the underlying algorithm works. At the bottom are links to the AV (you can run it with a built-in quiz system on or off). The first time you try to run any Jhave exercise, you will have to download the Jhave webstart application. This should happen automatically when you click the link. (You might need to install Java WebStart if it is not on your machine.) Once you download the Jhave application, the AV should start automatically. You can then step through the AV by repeatedly clicking the right arrow button. Occasionally, you will be given a multiple-choice or short-answer question to answer. |
|||||
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. |
