|Data Structures and Algorithms|
A trie is a special form of n-ary tree which can efficiently store strings. There is one child node for every common prefix string. It is particularly suited for dictionary-style applications.
This animation was written by
Students in CS at UWA
It is a prototype: volunteers to improve it are welcome!
|Continue on to Hash Tables||Back to the Table of Contents|