Trakla - Trie; Digital and Radix Search Trees
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
GPL |
||||
Language |
English |
||||
Author |
Ville Karavirta; Ari Korhonen; Lauri Malmi; Kimmo Stålnacke |
||||
Institution |
Helsinki University of Technology |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Exercises related to building a trie, and Digital and Radix Search Trees. User point at locations in the tree where the nodes should go. |
||||
Evaluation |
This cannot work on its own, since there is no explanation of the structures being presented. It should be easy to use if the user understands the algorithm. The trie seems the most accessible of the three. |
||||
Canned Data; Predictions |
|||||
Lecture Aid; Self Study; Lab Exercise |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2008-07-29 |
||||
Last Visited |
2008-07-29 |
||||
Last Updated |
2006-01-25 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
