Algorithms In Action - Radix Trie
Recommendation |
Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Linda Stern; Lee Naish; Harald Sondergaard |
||||
Institution |
University of Melbourne |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Demonstrates building a Radix Trie. Given a set of values, the trie structure is built step by step. |
||||
Evaluation |
Sophisticated use of pseudocode, that can expand to show more or less detail. Has an explanation window for how the data structure works. Slightly limited in that it doesn't support delete, but does a good job at what it does support. |
||||
Animation; Step Control; Canned Data; Random Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2008-07-02 |
||||
Last Visited |
2008-07-02 |
||||
Last Updated |
2000 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
