Data Structures Navigator - Binary Search Trees - Treap
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Jens-Peter Dittrich; Jochen van den Bercken; Tobias Schäfer; Marcus Klein |
||||
Institution |
Phillips-University of Marburg |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Allows user to insert/find/delete values in a Treap. |
||||
Evaluation |
Easy to use interface, nice graphics. The main problem is that there is no explanation of what is going on. The user can step through the rotation operations one by one, but any given splay operation happens rather quickly with no explanation of the process. So the user needs to already understand how the treap works (at least in principle) to get much from this. |
||||
Step Control; Animation; User Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-01 |
||||
Last Visited |
2008-07-16 |
||||
Last Updated |
2000-07-31 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
