Trakla - Trie; Digital and Radix Search Trees

Link(s)
http://www.cs.hut.fi/Research/TRAKLA2/exercises/index.shtml
Topic(s)
Tries, Search Structures



Recommendation
  
Lecture Aide Has Potential
Self-study Supplement Has Potential
Standalone Has Potential
Debugging Aide Not Recommended
Works?
Yes
Delivery Method(s)
Java Application
Project
TRAKLA2
Project Relationship
Part of project
Language(s)
English
Author(s)
Ville Karavirta, Ari Korhonen, Lauri Malmi, Kimmo Stålnacke
Institution(s)
Aalto University
Activity Level(s)
Canned data, Predictions
Source Code License
Licensed under GPL
First Published
N/A
Last Modified
N/A

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.
Usage Notes
Field Report(s)
References
N/A
Rating
0
No votes yet
Your rating: None
AV of the Day
No
Score
37