Recommendation: Has Potential.
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.